思路是模拟入栈出栈的过程
import java.util.*;
public class Solution {
public boolean IsPopOrder(int [] pushA,int [] popA) {
int size = pushA.length;
Stack<Integer> stack = new Stack<>();
int index_pop = 0;
for(int i=0;i<size;i++){
stack.push(pushA[i]);
while(!stack.empty() && stack.peek() == popA[index_pop]){
index_pop++;
stack.pop();
}
}
return stack.empty();
}
}