leetcode -- 946. Validate Stack Sequences

题目描述

题目难度：Medium

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.

• Example 1:

Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
Output: true
Explanation: We might do the following sequence:
push(1), push(2), push(3), push(4), pop() -> 4,
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1

• Example 2:

Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
Output: false
Explanation: 1 cannot be popped before 2.

Note:

0 <= pushed.length == popped.length <= 1000
0 <= pushed[i], popped[i] < 1000
pushed is a permutation of popped.
pushed and popped have distinct values.

AC代码

class Solution {
    public static boolean validateStackSequences(int[] pushed, int[] popped) {
            if(pushed.length == 0) return true;
            Stack<Integer> stack = new Stack<>(); // 保存已经入栈的数字
            int i = 0, j = 0;
            for(;i < pushed.length;i++){
                if(popped[j] == pushed[i]){
                    j++;
                }
                else{
                    if(stack.isEmpty()) stack.push(pushed[i]);
                    else{
                        int n = stack.peek();
                        while(popped[j] == n) {
                            j++;
                            stack.pop();
                            if(stack.isEmpty()) break;
                            n = stack.peek();
                        }
                        stack.push(pushed[i]);
                    }
                }
            }
            for(;j < popped.length;j++){
                if(popped[j] != stack.pop()) return false;
            }
            return true;
        }
}