栈的压入、弹出序列
OJ地址:栈的压入、弹出序列
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if(pushV.size() == 0)
{
return false;
}
stack<int> s;
int i, j;
i = j = 0;
while(i < pushV.size())
{
if(pushV[i] != popV[j])
{
s.push(pushV[i]);
++i;
}
else
{
++i;
++j;
}
}
while(!s.empty())
{
if(s.top() == popV[j])
{
s.pop();
j++;
}
else
{
return false;
}
}
return true;
}