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

import java.util.*;


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