解题思路:
(1)依次进栈,判断栈顶元素与出栈元素是否相同
class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
stack<int> s;
int i=0;
for(int j=0;j<pushed.size();j++) {
s.push(pushed[j]);
while(!s.empty() && s.top()==popped[i]) {
s.pop();
i++;
}
}
return i==popped.size();
}
};