用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。

// test14.cpp : 定义控制台应用程序的入口点。
//

include "stdafx.h"

include

include

include

include

include

include <initializer_list>

include

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 stack1;//作为入队序列
stack 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;
}