码迷,mamicode.com
首页 >  
搜索关键字:removes    ( 291个结果
Implementing 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 o...
分类:其他好文   时间:2015-08-18 06:33:25    阅读次数:112
Implementing Stacks Using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top()...
分类:其他好文   时间:2015-08-18 06:32:36    阅读次数:90
LeetCode-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.empt...
分类:其他好文   时间:2015-08-13 22:28:14    阅读次数:99
LeetCode-Implement Stack using Queues
Implement the following operations of a stack using queues. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet...
分类:其他好文   时间:2015-08-13 22:21:08    阅读次数:162
LeetCode-Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get...
分类:其他好文   时间:2015-08-13 15:48:22    阅读次数:97
1089. Insert or Merge (25)
题目如下: According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from ...
分类:其他好文   时间:2015-08-13 14:31:46    阅读次数:119
[LeetCode] 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....
分类:其他好文   时间:2015-08-11 11:53:13    阅读次数:67
[LeetCode] Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top()...
分类:其他好文   时间:2015-08-11 11:45:08    阅读次数:110
[leetcode 234]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(...
分类:其他好文   时间:2015-08-08 21:26:15    阅读次数:94
【leetcode】155 - Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes...
分类:其他好文   时间:2015-08-08 21:20:06    阅读次数:156
291条   上一页 1 ... 15 16 17 18 19 ... 30 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!