-
Notifications
You must be signed in to change notification settings - Fork 10
/
TwoStacksImplementQueue.java
57 lines (43 loc) · 1.14 KB
/
TwoStacksImplementQueue.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
package com.camnter.basicexercises.stack;
import java.util.Stack;
/**
* 两个栈实现队列
*
* @author CaMnter
*/
public class TwoStacksImplementQueue {
private static class Queue<T> {
private final Stack<T> inStack;
private final Stack<T> outStack;
public Queue() {
this.inStack = new Stack<T>();
this.outStack = new Stack<T>();
}
public void add(T t) {
this.inStack.add(t);
}
public T poll() {
if (outStack.isEmpty()) {
while (!inStack.isEmpty()) {
outStack.add(inStack.pop());
}
}
return outStack.pop();
}
public boolean isEmpty() {
return inStack.isEmpty() && outStack.isEmpty();
}
}
public static void main(String args[]) {
Queue<Integer> queue = new Queue<Integer>();
queue.add(1);
queue.add(2);
queue.add(3);
queue.add(4);
queue.add(5);
queue.add(6);
while (!queue.isEmpty()) {
System.out.print(queue.poll() + " ");
}
}
}