队列
Wu_uuuu
这个作者很懒,什么都没留下…
展开
-
Leetcode-232. Implement Queue using Stacks
题目Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty(原创 2017-04-04 11:54:36 · 359 阅读 · 0 评论 -
Leetcode--Add to List 215. Kth Largest Element in an Array
题目Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example, Given [3,2,1,5,6,4] and k = 2, return 5. 寻找原创 2017-07-03 11:05:23 · 348 阅读 · 0 评论