p.p1 { margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica }
【146】LRU Cache
【155】Min Stack
【170】Two Sum III - Data structure design
【173】Binary Search Tree Iterator
【208】Implement Trie (Prefix Tree)
【211】Add and Search Word - Data structure design
【225】Implement Stack using Queues
【232】Implement Queue using Stacks
【244】Shortest Word Distance II
【251】Flatten 2D Vector
【281】Zigzag Iterator
【284】Peeking Iterator
【288】Unique Word Abbreviation
【295】Find Median from Data Stream
【297】Serialize and Deserialize Binary Tree
【341】Flatten Nested List Iterator
【346】Moving Average from Data Stream
【348】Design Tic-Tac-Toe
【353】Design Snake Game
【355】Design Twitter
【359】Logger Rate Limiter
【362】Design Hit Counter
【379】Design Phone Directory
【380】Insert Delete GetRandom O(1)
【381】Insert Delete GetRandom O(1) - Duplicates allowed
【432】All O`one Data Structure
【460】LFU Cache
【588】Design In-Memory File System
【604】Design Compressed String Iterator
【622】Design Circular Queue
【631】Design Excel Sum Formula
【635】Design Log Storage System
【641】Design Circular Deque
【642】Design Search Autocomplete System
【705】Design HashSet
【706】Design HashMap
【707】Design Linked List
【716】Max Stack
原文地址:https://www.cnblogs.com/zhangwanying/p/9886723.html