码迷,mamicode.com
首页 >  
搜索关键字:removes    ( 291个结果
LeetCode155: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 the t...
分类:其他好文   时间:2015-07-10 23:45:14    阅读次数:157
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-10 23:44:01    阅读次数:153
LeetCode225 Implemet Stack using Queues Java题解
题目: 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() -- Re...
分类:编程语言   时间:2015-07-09 14:41:27    阅读次数:135
LeetCode232 Implement Queue using Stacks Java 题解
题目: 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 eleme...
分类:编程语言   时间:2015-07-09 14:40:55    阅读次数:117
[LeetCode] Implement Queue using Stacks
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()...
分类:其他好文   时间:2015-07-08 22:37:27    阅读次数:176
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-07-08 14:26:08    阅读次数:123
[LeetCode][JavaScript]Implement Queue using Stacks
Implement Queue using StacksImplement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes...
分类:编程语言   时间:2015-07-08 02:06:23    阅读次数:143
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-07-07 22:55:28    阅读次数:133
【LeetCode】232. Implement Queue using Stacks
Implement Queue using StacksImplement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes...
分类:其他好文   时间:2015-07-07 22:30:22    阅读次数:182
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 o...
分类:其他好文   时间:2015-07-07 18:38:05    阅读次数:120
291条   上一页 1 ... 19 20 21 22 23 ... 30 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!