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

import java.util.*;


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