用两个栈来实现一个队列,完成队列的Push和Pop操作。 队列中的元素为int类型
package 栈;
import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.add(node);
}
public int pop() {
if(stack1==null){
return 0;
}
while(!stack1.isEmpty()){
stack2.push(stack1.pop());
}
int result=stack2.pop();
while(!stack2.isEmpty()){
stack1.push(stack2.pop());
}
return result;
}
public static void main(String[] args) {
Solution s=new Solution();
s.push(1);
s.push(2);
s.push(3); //1 2 3 4 5
//5 4 3 2
//2 3 4 5
System.out.println(s.pop());
System.out.println(s.pop());
}
}
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.add(node);
}
public int pop() {
if(stack1==null){
return 0;
}
while(!stack1.isEmpty()){
stack2.push(stack1.pop());
}
int result=stack2.pop();
while(!stack2.isEmpty()){
stack1.push(stack2.pop());
}
return result;
}
public static void main(String[] args) {
Solution s=new Solution();
s.push(1);
s.push(2);
s.push(3); //1 2 3 4 5
//5 4 3 2
//2 3 4 5
System.out.println(s.pop());
System.out.println(s.pop());
}
}