5. ＜ tag stack and general problems ＞ supplement: lt.946 Verify the stack sequence (the same as the push in and pop-up sequence of offer 31. stack)

lt.946. Verify stack sequence

[ Case needs ]

[ Thought analysis ]

[ Code implementation ]

class Solution {
    
    public boolean validateStackSequences(int[] pushed, int[] popped) {
    
        //pushed First out of the stack ,  encounter poped The same elements of ,  Then take it. pop Full stack ;
        Deque<Integer> stack = new LinkedList<>();
        int i = 0;

        for(int num : pushed){
    
            stack.push(num);        

            while(!stack.isEmpty() && stack.peek() == popped[i]){
    
                stack.pop();
                ++i;
            }
        }

        return stack.isEmpty();
    }
}

The specific problem solution : Am I