栈的压入、弹出序列
题目描述
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
#include "stdafx.h"
#include<vector>
#include<stack>
#include<iostream>
using namespace std;
class Solution {
public:
bool IsPopOrder(vector<int> pushV, vector<int> popV) {
if (pushV.size() != popV.size())
{
return false;
}
vector<int>::iterator pushIt = pushV.begin();
vector<int>::iterator popIt = popV.begin();
stack<int> st;
for (; pushIt != pushV.end() && popIt != popV.end(); pushIt++)
{
st.push(*pushIt);
while (st.size()!=0 && popIt!=popV.end() && st.top() == *popIt)
{
st.pop();
popIt++;
}
}
if (st.size() == 0)
{
return true;
}
else
{
return false;
}
}
};
int main()
{
Solution *s = new Solution();
vector<int> pushV = {1,2,3,4,5};
vector<int> popV = {4,5,3,2,1};
cout<<s->IsPopOrder(pushV,popV)<<endl;
return 0;
}