1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
| class Solution {
public:
bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
stack<int> s;
int p = 0;
for(auto num : pushed)
{
s.push(num);
while(!s.empty() && s.top() == popped[p])
{
s.pop();
++p;
}
}
return s.empty();
}
};
|