栈的压入、弹出序列

创建一个辅助栈，想让数组中的元素一个个进栈，每进去一个就和出栈数组的元素进行对比，相等就出栈

import java.util.*;

public class Solution {
    public boolean IsPopOrder(int [] pushA,int [] popA) {
       Stack<Integer> stack = new Stack<>();
        int j = 0;
        for(int i = 0; i < pushA.length; i++) {
            stack.push(pushA[i]);
            
            while(!stack.isEmpty() && stack.peek() == popA[j]) {
                stack.pop();
                j++;
            }
        }
        return stack.isEmpty();
    }
}