牛客OJ：判断两个序列是否为栈压入序列和弹出序列

class Solution {
public:
    bool IsPopOrder(vector<int> pushV,vector<int> popV) {
        int l = pushV.size();
        int loc1,loc2;
        loc1=loc2 = 0;
        stack<int> s;
        while(loc1<l&&loc2<l){
            s.push(pushV[loc1++]);
            while(!s.empty() && s.top() == popV[loc2]) s.pop(),loc2++;
        }
        if(loc2 == l) return true;
        else return false;
    }
};