本来我以为这个会非常简单,一直也没有自己扣,万万没想到
我就是这么写的:
import java.util.Stack;
public class Solution {
Stack<Integer> in = new Stack<Integer>();
Stack<Integer> out = new Stack<Integer>();
public void push(int node) {
in.push(node);
}
public int pop() {
while (!in.isEmpty())
out.push(in.pop());
return out.pop();
}
}
报错:
用例:
["PSH1","PSH2","PSH3","POP","POP","PSH4","POP","PSH5","POP","POP"]
对应输出应该为:
1,2,3,4,5
你的输出为:
1,2,4,5,3
什么意思呢?
就是说,push和pop是包括交叉进行的,而不是一次性push之后pop。下面的解法也是非常巧妙地,每次判断out是否为空,如果空,就可以往out里面倒,如果不为空,就要先清空out,这样解决了顺序的问题。
import java.util.Stack;
public class Solution {
Stack<Integer> in = new Stack<Integer>();
Stack<Integer> out = new Stack<Integer>();
public void push(int node) {
in.push(node);
}
public int pop() {
if (out.isEmpty())
while (!in.isEmpty())
out.push(in.pop());
return out.pop();
}
}