题目描述
用两个栈来实现一个队列,完成队列的Push和Pop操作。 队列中的元素为int类型。
时间限制:1秒 空间限制:32768K 热度指数:223057
本题知识点: 队列 栈
#include<iostream>
#include<string>
#include<exception>
#include<stack>
using namespace std;
/*class Solution
{
public:
void push(int node) {
while (!stack2.empty())//入队时,要保证stack2为空
{
stack1.push(stack2.top());
stack2.pop();
}
stack1.push(node);
cout << "入队元素是:" <<stack1.top()<< endl;
}
int pop() {
while(!stack1.empty())//出队时,要保证stack1为空
{
stack2.push(stack1.top());
stack1.pop();
}
cout << "出队元素是:" << stack2.top() << endl;
int temp = stack2.top();
stack2.pop();
return temp;
}
private:
stack<int> stack1;//作为入队序列
stack<int> stack2;//作为出队序列
};*/
class Solution
{
public:
void push(int node) {
stack1.push(node);
cout << "入队元素是:" <<stack1.top()<< endl;
}
int pop() {
if(stack2.empty()){
while(!stack1.empty()){
stack2.push(stack1.top());
stack1.pop();
}
}
cout << "出队元素是:" << stack2.top() << endl;
int tmp=stack2.top();
stack2.pop();
return tmp;
}
private:
stack<int> stack1;//入队
stack<int> stack2;//出队
};
int main()
{
Solution so;
so.push(1);
so.push(2);
so.push(3);
so.pop();
so.pop();
so.push(4);
so.pop();
so.push(5);
so.pop();
so.pop();
cout << endl;
return 0;
}
参考博客:https://www.cnblogs.com/wdan2016/p/5942229.html
https://blog.csdn.net/veaxen/article/details/61196397