直接模拟有没有这样一个弹出序列即可
class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
stack<int> a;
int posa = 0,posb = 0;
while(posa < pushed.size()){
if(a.size() == 0 || a.top() != popped[posb])
a.push(pushed[posa++]);
else{
a.pop();
posb++;
}
}
while(!a.empty() && posb < popped.size() && a.top() == popped[posb])
a.pop(),posb++;
return a.empty() ? true : false;
}
};