栈的出站序列判断

写代码尽量简洁一点

《栈的出站序列判断》

bool IsPopOrder(vector<int> pushV, vector<int> popV)
{
  if (pushV.size() == 0)
    return false;
  stack<int> S;
  int i = 0, j = 0;
  while (i != pushV.size())
  {
    S.push(pushV[i++]);
    while (!S.empty() && j != popV.size() && popV[j] == S.top())
    {
      S.pop();
      j++;
    }
  }
  return S.empty();
}