输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如,序列 {1,2,3,4,5} 是某栈的压栈序列,序列 {4,5,3,2,1} 是该压栈序列对应的一个弹出序列,但 {4,3,5,1,2} 就不可能是该压栈序列的弹出序列。
// let pushed = [1, 2, 3, 4, 5],
// popped = [4, 5, 3, 2, 1];
let pushed = [2, 1, 0],
popped = [1, 2, 0];
var validateStackSequences = function(pushed, popped) {
let stack = [],
j = 0;
for (let i = 0; i < pushed.length; i++) {
stack.push(pushed[i]);
while (stack.length != 0 && stack[stack.length - 1] == popped[j]) {
stack.pop();
j++;
}
}
return !stack.length;
};
console.log(validateStackSequences(pushed, popped));