类似:剑指 Offer 31. 栈的压入、弹出序列_zj-CSDN博客
class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
stack<int> s;
int i = 0;
for(const auto &c : pushed){
s.push(c);
while(i < popped.size() && !s.empty() && s.top() == popped[i]){
s.pop();
++i;
}
}
return s.empty();
}
};