题解 | #牛牛出入圈#

#include <cstdio>
#include <vector>
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param enter int整型vector
     * @param leave int整型vector
     * @return bool布尔型
     */
    bool validateCowCircle(vector<int>& enter, vector<int>& leave) {
        // write code here
        int it = 0;
        vector<int> stk = vector<int>();
        for (auto num : enter) {
            stk.push_back(num);
            while (stk.size () > 0 && stk.back() == leave[it]) { // 栈顶符合出栈
                stk.pop_back();
                it++;
            }
        }
        
        while (stk.size() > 0) {
            if (stk.back() == leave[it]) { // 栈顶符合出栈
                stk.pop_back();
                it++;
            } else {
                return false;
            }

        }
        return true;
    }
};

进出栈模拟