LeetCode-946 Validate Stack Sequences Solution (with Java)

1. Description:

Notes:

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2019-05-09
 */
class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        Stack<Integer> stack = new Stack<>();
        int i = 0, j = 0;
        while (i < pushed.length && j < popped.length){
            stack.push(pushed[i++]);
            while(!stack.isEmpty() && stack.peek() == popped[j]){
                stack.pop();
                j++;
            }
        }
        return stack.isEmpty();
    }
}