输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否为该栈的弹出顺序
假设压入栈的所有数字均不相等。例如序列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() == 0)
return false;
vector<int> stack;
for(int i = 0,j = 0 ;i < pushV.size();)
{
stack.push_back(pushV[i++]);
while(j < popV.size() && stack.back() == popV[j])
{
stack.pop_back();
j++;
}
}
return stack.empty();
}
};
用两个栈实现一个队列
class Solution
{
public:
void push(int node) {
stack1.push(node);
}
int pop() {
if(stack2.size()==0)
{
while(stack1.size()>0)
{
int data=stack1.top();
stack1.pop();
stack2.push(data);
}
}
if(stack2.size()==0)
return 0;
int head=stack2.top();
stack2.pop();
return head;
}
private:
stack<int> stack1;
stack<int> stack2;
};
用递归函数和栈操作来逆序栈
class ReverseStack {
public:
vector<int> reverseStackRecursively(vector<int> stack, int top)
{
vector<int> ret;
if (stack.empty())
return ret;
int k = getLastElem(stack);//获取最底部元素
stack = reverseStackRecursively(stack, top - 1);//递归调用
stack.push_back(k);//压入栈
return stack;
}
//获取stack最底部的元素并移除
int getLastElem(vector<int> &stack)
{
int top = stack.back();
stack.pop_back();
if (stack.empty())
return top;
else
{
int last = getLastElem(stack);
stack.push_back(top);
return last;
}
}
};