描述
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
示例1
输入:
[1,2,3,4,5],[4,3,5,1,2]
复制返回值:
false
public class Jz21_IsPopOrder {
@Test
public void test(){
int[] pushA ={1,2,3,4,5};
int[] popA ={4,3,5,2,1};
boolean b = IsPopOrder(pushA, popA);
System.out.println(b);
}
public boolean IsPopOrder(int[] pushA, int[] popA) {
if (null == popA || null == pushA || popA.length != popA.length) {
return false;
}
Stack<Integer> stack = new Stack<>();
int pPos = 0;
for (int i = 0; i < pushA.length; i++) {
stack.push(pushA[i]);
while (!stack.empty() && pPos < popA.length && stack.peek() == popA[pPos]) {
stack.pop();
pPos++;
}
}
if(pPos == popA.length){
return true;
}
return false;
}
}