(个人水平有限,请见谅!)
题目描述:
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
代码示例:
数组思路:
class Solution {
public:
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if (pushV.size() != popV.size())
return false;
int cnt = -1;
for (int i = 0; i < pushV.size(); i++)
{
if (pushV[i] == popV[0])
{
cnt = i;
break;
}
}
if (cnt == -1)
return false;
int left = cnt-1;
int right = cnt+1;
int p = 1;
while (left>=0 && right<pushV.size())
{
if (pushV[left] == popV[p])
left--;
else if (pushV[right == popV[p]])
right++;
else
return false;
p++;
}
if (left<0 && right<pushV.size())
{
while (right < pushV.size())
{
if (pushV[right] != popV[p])
return false;
else
right++;
p++;
}
}
if (left>=0 && right>=pushV.size())
{
while (left >= 0)
{
if (pushV[left] != popV[p])
return false;
else
left--;
p++;
}
}
return true;
}
};
栈思路:
class Solution {
public:
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if (pushV.size() != popV.size())
return false;
stack <int> st;
for (int i=0,j=0; i < pushV.size(); i++)
{
st.push(pushV[i]);
// while中条件顺序别弄错,必须先判断j
while (j<popV.size() && popV[j]==st.top())
{
st.pop();
j++;
}
}
return st.empty();
}
};