import java.util.Stack;
public class Solution {
public boolean IsPopOrder(int [] pushA,int [] popA) {
if(pushA.length==0||popA.length==0)
return false;
Stack <Integer> s=new Stack<Integer>();
int j=0;
for(int i=0;i<pushA.length;i++){
s.push(pushA[i]);
//模拟了进栈出栈的顺序,就相当于有一个元素进栈就去判断popA[j]下是否是出栈的顺序,是就把该元素顺序从s栈出栈
while (j < popA.length && s.peek() == popA[j]) {
s.pop();
j++;
}
}
return s.isEmpty() ? true:false;
}
}