946 验证栈的序列
class Solution {
public boolean validateStackSequences(int[] pushed, int[] popped) {
//pushed数组的长度
int len=pushed.length;
//popped数组指针
int j=0;
Stack<Integer> stack=new Stack<>();
for(int i=0;i<len;i++){
//压栈
stack.push(pushed[i]);
//判断条件 栈不空&j<pushed数组长度&栈顶元素==popped数组元素
while(!stack.isEmpty()&&j<len&&stack.peek()==popped[j]){
//指针向后移并且将栈顶元素弹出
j++;
stack.pop();
}
}
//判断元素是否全部弹出
return j==len;
}
}