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

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 j=0;
        for (int i = 0; i < pushV.length; i++) {
            stack.push(pushV[i]);
            if (stack.peek() == popV[j] && j < popV.length) {
                while (j < popV.length) {
                    if (stack.isEmpty()||stack.peek() != popV[j]) {
                        break;
                    }
                    stack.pop();
                    j++;

                }
            }
            if (j == popV.length && !stack.empty()) {
               
                return false;
            }
        }
        if (stack.empty()) {
           
            return true;
        }
       
        return false;
    }
}