题解 | #栈的压入、弹出序列#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pushV int整型一维数组
     * @param popV int整型一维数组
     * @return bool布尔型
     */
    public boolean IsPopOrder (int[] pushV, int[] popV) {
        Stack<Integer> stack = new Stack<>();
        int curI = 0;
        for (int pop : popV) {
            if (!stack.isEmpty() && pop == stack.peek()) {
                stack.pop();
            } else {
                if (stack.contains(pop)) {
                    return false;
                } else {
                    while (curI < pushV.length && pushV[curI++] != pop) {
                        stack.push(pushV[curI - 1]);
                    }
                }
            }
        }
        return stack.isEmpty();
    }
}