946. Validate Stack Sequences

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.
Example 1:
Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
Output: true
Explanation: We might do the following sequence:
push(1), push(2), push(3), push(4), pop() -> 4,
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
Example 2:
Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
Output: false
Explanation: 1 cannot be popped before 2.

题意：给一个入栈序列和出栈序列，判断通过操作入栈和出栈能否生成出栈序列中的序列

思路：题目比较简单，也没有什么坑，就按普通的出入栈顺序模拟一边就可以了

class Solution {
public:
    bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
        stack<int> my_stack;

        for(auto item:pushed){
            my_stack.push(item);
            while(!my_stack.empty() && popped[0]==my_stack.top()){
                my_stack.pop();
                popped.erase(popped.begin());
            }
        }

        return my_stack.empty();
    }
};