1.栈的压入弹出,pushV序列表示栈的压入顺序,判断popV序列是否是该栈的一种弹出顺序
//大致思路就是,首先按照pushV的顺序压入栈,当栈顶和popV的值相同时出栈。判断栈最后是否会有剩余序列
bool IsPopOrder(vector<int> pushV, vector<int> popV)
{
stack<int> tmpStack;
int i = 0;
int j = 0;
while (i < pushV.size())
{
tmpStack.push(pushV[i]);
++i;
while (j < popV.size() && popV[j] == tmpStack.top())
{
tmpStack.pop();
++j;
}
}
if (tmpStack.size())
{
return false;
}
return true;
}