剑指Offer——栈的压入、弹出序列（JS实现） ｜刷题打卡

var validateStackSequences = function (pushed, popped) {
    // 本题使用模拟栈的写法
    const stack = [];
    // 定义一个指向popped元素的指针
    let pointer = 0;
    for (let i = 0; i < pushed.length; i++) {
        stack.push(pushed[i]);
        if (popped[pointer] === pushed[i]) {
            stack.pop();
            pointer++;
        }
        if (pointer === popped.length) break;
        while (stack[stack.length-1] === popped[pointer]) {
            stack.pop();
            pointer++;
            if (pointer === popped.length) return true;
        }
    }
    while (stack.length !== 0) {
        if(stack[stack.length - 1] === popped[pointer]) {
            stack.pop();
            pointer++;
        } else {
            return false;
        }  
    }
    return true;
};