#include <iostream>
#include <stack>
using namespace std;
//用两个栈实现一个队列stack1专门用来入队  stack2专门用来出队
template<class T>class Queue
{
public:Queue(void){};~Queue(void){};void AppendTail(const T &ele);T DeleHead();
private:stack<T>stack1;stack<T>stack2;};//stack1专门用来入栈
template<class T> void Queue<T>::AppendTail(const T &ele)
{stack1.push(ele);
}
//stack2作为临时缓冲，将stack1入栈的元素逆序 然后出栈即可实现先入先出
template<class T> T Queue<T>::DeleHead()
{if (stack2.size()<=0)//stack2空 则将stack1的元素都放在stack2中
    {while (stack1.size()>0){T node=stack1.top();stack2.push(node);stack1.pop();}}if (stack2.size()==0)//判断栈是否为空
    {cout<<"empty"<<endl;throw new exception();}T RetNode =stack2.top();//返回stack2的栈顶元素stack2.pop();//出栈return RetNode;
}void main()
{Queue<int>*pQu=new Queue<int>();pQu->AppendTail(1);pQu->AppendTail(2);pQu->AppendTail(3);cout<<pQu->DeleHead()<<endl;pQu->AppendTail(4);pQu->AppendTail(5);cout<<pQu->DeleHead()<<endl;cout<<pQu->DeleHead()<<endl;cout<<pQu->DeleHead()<<endl;cout<<pQu->DeleHead()<<endl;cout<<pQu->DeleHead()<<endl;}

#include <queue>
#include <iostream>
using namespace std;
template <class T>
class Stack
{
public:Stack(){};~Stack(){};void StackPush(const T&data);T StackPop();
private:queue<T>que1;queue<T>que2;
};
//que1专门用来入栈
template<class T> void Stack<T>::StackPush(const T&data)
{que1.push(data);
}
//que2作为临时存储que1的多余变量，当出栈后要将所有元素还给que1
template<class T> T Stack<T>::StackPop()
{if (que1.size()<=0){cout<<"empty"<<endl;throw new exception("empty");}else//que1的变量大于等于1个时{while(que1.size()>1)//将最先入n-1个元素的存que2中{que2.push(que1.front());que1.pop();}T RetData=que1.front();//返回最后入的元素que1.pop();while(que2.size()>0)//再将que2的元素存回que1{que1.push(que2.front());que2.pop();}return RetData;}
}void main()
{Stack<int > *pSt=new Stack<int >();pSt->StackPush(1);pSt->StackPush(2);pSt->StackPush(3);cout<<pSt->StackPop()<<endl;cout<<pSt->StackPop()<<endl;cout<<pSt->StackPop()<<endl;
//  cout<<pSt->StackPop()<<endl;//抛异常
}

#include <queue>
#include <iostream>
using namespace std;
template <class T>
class Stack
{
public:Stack(){};~Stack(){};void StackPush(const T&data);T StackPop();
private:queue<T>que1;queue<T>que2;static bool flag;//用来标识该在哪个队列入栈的标识
};template<class T> bool Stack<T>::flag=true;//初始化为TRUE 在que1中入栈
template<class T> void Stack<T>::StackPush(const T&data)
{queue<T>*quTemp=NULL;//用于指向要入栈的队列，注意初始化格式if (flag)//标识用来决定该入栈到哪个队列
    {quTemp=&que1;}else {quTemp=&que2;}quTemp->push(data);
}template<class T> T Stack<T>::StackPop()
{flag=!flag;//将标识取反queue<T>*popTemp=NULL;//用于出栈的临时队列queue<T>*saveTemp=NULL;//用于保存n-1个多余变量的队列if (que1.size()>=1){popTemp=&que1;saveTemp=&que2;}else{popTemp=&que2;saveTemp=&que1;}if (popTemp->size()<=0){cout<<"Empty"<<endl;throw new exception("the stack is empty");}while(popTemp->size()>1)//出栈的队列中元素大于1个 移动到另一个队列中
    {saveTemp->push(popTemp->front());popTemp->pop();}T RetVal=popTemp->front();//返回最后一个元素popTemp->pop();return RetVal;
}void main()
{Stack<int> *pSt=new Stack<int>();pSt->StackPush(1);pSt->StackPush(2);pSt->StackPush(3);cout<<pSt->StackPop()<<endl;cout<<pSt->StackPop()<<endl;pSt->StackPush(4);pSt->StackPush(5);    cout<<pSt->StackPop()<<endl;cout<<pSt->StackPop()<<endl;cout<<pSt->StackPop()<<endl;}