solution:
默认压入栈,如果栈顶元素等于出栈元素,则pop().
class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
stack<int> stk;
int j = 0;
for(int i = 0;i < pushed.size();i++) {
stk.push(pushed[i]);
while(j < popped.size() && !stk.empty() && stk.top() == popped[j]) {
stk.pop();
j++;
}
}
return j == pushed.size();
}
};