leetcode设计
文章平均质量分 56
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
1600. Throne Inheritance[Medium](Leetcode每日一题-2021.06.20)--抄答案
Problem原创 2021-06-21 22:25:01 · 383 阅读 · 0 评论 -
341. Flatten Nested List Iterator(Leetcode每日一题-2021.03.23)
ProblemGiven a nested list of integers, implement an iterator to flatten it.Each element is either an integer, or a list – whose elements may also be integers or other lists.Example1Input: [[1,1],2,[1,1]]Output: [1,1,2,1,1]Explanation: By calling ne原创 2021-03-23 20:51:19 · 188 阅读 · 0 评论 -
706. Design HashMap(Leetcode每日一题-2021.03.14)
ProblemDesign a HashMap without using any built-in hash table libraries.Implement the MyHashMap class:MyHashMap() initializes the object with an empty map.void put(int key, int value) inserts a (key, value) pair into the HashMap. If the key already ex原创 2021-03-14 18:59:36 · 185 阅读 · 0 评论 -
705. Design HashSet(Leetcode每日一题-2021.03.13)
ProblemDesign a HashSet without using any built-in hash table libraries.Implement MyHashSet class:void add(key) Inserts the value key into the HashSet.bool contains(key) Returns whether the value key exists in the HashSet or not.void remove(key) Remov原创 2021-03-13 21:38:50 · 211 阅读 · 0 评论 -
232. Implement Queue using Stacks(Leetcode每日一题-2021.03.05)
ProblemImplement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).Implement the MyQueue class:void push(int x) Pushes element x to the back of原创 2021-03-05 20:11:12 · 122 阅读 · 0 评论 -
703. Kth Largest Element in a Stream(Leetcode每日一题-2021.02.11)
ProblemDesign a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.Implement KthLargest class:KthLargest(int k, int[] nums) Initializes the object with the integer原创 2021-02-11 09:53:16 · 177 阅读 · 0 评论 -
297. Serialize and Deserialize Binary Tree(Leetcode每日一题-2020.06.16)
ProblemSerialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another comp原创 2020-06-16 21:15:19 · 231 阅读 · 0 评论 -
146. LRU Cache(Leetcode每日一题-2020.05.25)
ProblemDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.p原创 2020-05-25 22:05:44 · 257 阅读 · 0 评论 -
355. Design Twitter(Leetcode每日一题-2020.04.13)
占位原创 2020-04-14 22:51:13 · 203 阅读 · 0 评论 -
460. LFU缓存(Leetcode每日一题-2020.04.05)
ProblemDesign and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put.get(key) - Get the value (will always be positive) of the ...原创 2020-04-05 18:00:56 · 218 阅读 · 0 评论 -
面试题59 - II. 队列的最大值(Leetcode每日一题-2020.03.07)
Problem请定义一个队列并实现函数 max_value 得到队列里的最大值,要求函数max_value、push_back 和 pop_front 的均摊时间复杂度都是O(1)。若队列为空,pop_front 和 max_value 需要返回 -1Example1输入:[“MaxQueue”,“push_back”,“push_back”,“max_value”,“pop_fron...原创 2020-03-07 22:02:36 · 214 阅读 · 0 评论