Implement Queue by Stacks

原题链接： http://lintcode.com/zh-cn/problem/implement-queue-by-stacks/#

As the title described, you should only use two stacks to implement a queue's actions.

The queue should support push(element), pop() and top() where pop is pop the first(a.k.a front) element in the queue.

Both pop and top methods should return the value of first element.

样例

For push(1), pop(), push(2), push(3), top(), pop(), you should return 1, 2 and 2

挑战

implement it by two stacks, do not use any other data structure and push, pop and top should be O(1) by AVERAGE.

SOLUTION 1:

使用两个栈，stack1和stack2。

http://www.ninechapter.com/problem/49/

对于Queue的操作对应如下：

Queue.Push:

push到Stack1

Queue.Pop:

如果Stack2非空，Stack2.pop

否则将Stack1中的所有数pop到Stack2中（相当于顺序颠倒了放入），然后Stack2.pop()

每个数进出Stack1和Stack2各1次，所以两个操作的均摊复杂度均为O(1)

 1 public class Solution {
 2     private Stack<Integer> stack1;
 3     private Stack<Integer> stack2;
 4
 5     public Solution() {
 6        // do initialization if necessary
 7        stack1 = new Stack<Integer>();
 8        stack2 = new Stack<Integer>();
 9     }
10
11     public void push(int element) {
12         // write your code here
13         stack1.push(element);
14     }
15
16     public int pop() {
17         // write your code here
18         if (stack2.isEmpty()) {
19             while (!stack1.isEmpty()) {
20                 stack2.push(stack1.pop());
21             }
22         }
23
24         return stack2.pop();
25     }
26
27     public int top() {
28         // write your code here
29         // write your code here
30         if (stack2.isEmpty()) {
31             while (!stack1.isEmpty()) {
32                 stack2.push(stack1.pop());
33             }
34         }
35
36         return stack2.peek();
37     }
38 }

View Code

GITHUB:

https://github.com/yuzhangcmu/LeetCode_algorithm/blob/master/lintcode/stack/StackQueue.java

Lintcode: Implement Queue by Stacks 解题报告相关推荐

LeetCode刷题记录12——232. Implement Queue using Stacks（easy）
LeetCode刷题记录12--232. Implement Queue using Stacks(easy) 目录 LeetCode刷题记录12--232. Implement Queue usin ...
使用栈实现队列 Implement Queue using Stacks
为什么80%的码农都做不了架构师?>>> 问题: Implement the following operations of a queue using stacks. pus ...
LeetCode 232. Implement Queue using Stacks
题目: Implement the following operations of a queue using stacks. push(x) – Push element x to the back ...
C#LeetCode刷题之#232-用栈实现队列（Implement Queue using Stacks）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4108 访问. 使用栈实现队列的下列操作: push(x) -- ...
leetcode python3 简单题232. Implement Queue using Stacks
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二百三十二题 (1)题目英文: Implement the following ...
25行代码AC——习题5-7 打印队列(Printer Queue,UVa 12100)——解题报告
励志用尽量少的代码做高效的表达. 题目(提交)链接→UVa-12100 题目描述: 我们需要用打印机打印任务.每个任务都有1~9间的优先级,优先级越高,任务越急. 打印机的运作方式:从打印队列里取出一 ...
LeetCode Implement Queue using Stacks （数据结构）
题意: 用栈来实现队列. 思路: 一个栈是不够的,至少要两个. (1)插入.永远只插入到stack1中(插到栈顶). (2)弹出.如果stack2不为空,直接弹出stack2的栈顶,否则,将stack ...
leetcode 232. 用栈实现队列(Implement Queue using Stacks)
目录题目描述: 示例: 说明: 解法: 题目描述: 使用栈实现队列的下列操作: push(x) -- 将一个元素放入队列的尾部. pop() -- 从队列首部移除元素. peek() -- 返回队列 ...
[CareerCup] 3.5 Implement Queue using Two Stacks 使用两个栈来实现队列
3.5 Implement a MyQueue class which implements a queue using two stacks. LeetCode上的原题,请参见我之前的博客Imple ...

Lintcode: Implement Queue by Stacks 解题报告

Implement Queue by Stacks

SOLUTION 1:

GITHUB:

Lintcode: Implement Queue by Stacks 解题报告相关推荐

最新文章

热门文章