946. Validate Stack Sequences

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

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

class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        int loop = pushed.length;
        Stack<Integer> stack = new Stack();

        int index = 0;
        //for (int x: pushed) {
        for(int i=0; i<loop; i++){
            //stack.push(x);
            stack.push(pushed[i]);
            while (!stack.isEmpty() && index < loop && stack.peek() == popped[index]) {
                stack.pop();
                index++;
            }
        }

        return index == loop;
    }
}

class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        int loop = pushed.length;
        int[] stack = new int[loop];
        int peek = -1;
        
        int curr = 0;
        for(int i=0; i<loop; i++){
            stack[++peek] = pushed[i];
            
            while(peek > -1 && curr < loop && stack[peek] == popped[curr]){
                peek--;
                curr++;
            }
        }
        
        return curr == loop;
    }
}

[문제] https://leetcode.com/problems/validate-stack-sequences/