码迷,mamicode.com
首页 >  
搜索关键字:removes    ( 291个结果
【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 o...
分类:其他好文   时间:2015-08-02 15:02:17    阅读次数:82
[leedcode 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-01 23:17:36    阅读次数:108
[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(...
分类:其他好文   时间:2015-08-01 10:08:20    阅读次数:120
LeetCode232——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-07-31 18:29:47    阅读次数:93
LeetCode225——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-07-31 18:23:24    阅读次数:77
(easy)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 o...
分类:其他好文   时间:2015-07-30 22:43:42    阅读次数:113
(easy)LeetCode 225.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-07-30 21:06:04    阅读次数:113
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 whether...
分类:其他好文   时间:2015-07-27 19:07:07    阅读次数:87
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-07-23 13:42:34    阅读次数:106
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.empty() --...
分类:其他好文   时间:2015-07-21 17:22:00    阅读次数:109
291条   上一页 1 ... 17 18 19 20 21 ... 30 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!