LeetCode 946.验证栈序列
关注出栈序列即可:
1.现有的栈顶元素
2.未来要入栈的元素
判断pushed栈顶元素是否和popped当前元素相等
class Solution {
public:
bool validateStackSequences(vector<int>& pushed,vector<int>& popped) {
stack<int> s;
for(int i = 0, j = 0; i < popped.size(); i++){
while(j < pushed.size() && (s.empty() || s.top() != popped[i])){
s.push(pushed[j]);
j += 1;
}
if(s.top() != popped[i]) return false;
s.pop();
}
return true;
}
};