栈的压入和弹出序列

class Solution { public: bool IsPopOrder(vector<int> pushV,vector<int> popV) { int len = pushV.size(); int i = 0; int j = 0; stack<int> s; while(i < len &&

>>阅读原文<<