剑指offer--31栈的压入弹出序列

Posted 2021-08-27 Anrys

剑指offer--31栈的压入、弹出序列

• 题目
• 代码
• 结果

题目

代码

class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        Deque<Integer> stack = new ArrayDeque<>();
        int j = 0; //索引popped
        for (int i = 0; i < pushed.length; i++) {
            stack.push(pushed[i]);
            while (!stack.isEmpty() && stack.peek() == popped[j]) {
                j++;
                stack.pop();
            }
        }
        return stack.isEmpty();
    }
}

结果