[编程题]栈的压入、弹出序列
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
Java:
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
public class Solution {
private List<Integer> IntArrayToList(int[] array)
{
List<Integer> ret = new ArrayList<>();
for (int j : array)
{
ret.add(j);
}
return ret;
}
public boolean IsPopOrder(int [] pushA,int [] popA) {
List<Integer> pushList = IntArrayToList(pushA);
List<Integer> popList = IntArrayToList(popA);
Deque<Integer> stack = new LinkedList<>();
while (!popList.isEmpty())
{
int temp = popList.remove(0);
while (true)
{
if (stack.isEmpty() || stack.peek() != temp)
{
if (pushList.isEmpty())
{
return false;
}
int q = pushList.remove(0);
stack.push(q);
} else
{
break;
}
}
stack.pop();
}
return stack.isEmpty();
}
}
C++:
class Solution {
public:
bool IsPopOrder(vector<int> pushV,vector<int> popV) {
if(pushV.size() != popV.size())
{
return false;
}
stack<int> s;
size_t index = 0,outdex = 0;
while(outdex < popV.size())
{
while(s.empty() || s.top() != popV[outdex])
{
if(index < pushV.size())
{
s.push(pushV[index++]);
}
else
{
return false;
}
}
s.pop();
outdex++;
}
return true;
}
};