#include <iostream>
#include <stack>
using namespace std;
template <typename T>
class CQueue {
public:
CQueue(){}
~CQueue(){}
void appendTail(const T &node);
T deleteHead();
private:
stack<T> stack1;
stack<T> stack2;
};
template<typename T>
void CQueue<T>::appendTail(const T &element)
{
stack1.push(element);
}
template<typename T>
T CQueue<T>::deleteHead()
{
if(stack2.size<=0)
{
while(!stack1.empty())
{
int e=stack1.top();
stack1.pop();
stack2.push(e);
}
}
T head=stack2.top();
stack2.pop();
return head;
}
#include <iostream>
#include <queue>
using namespace std;
class CStack {
public:
CStack()
{
}
~CStack()
{
}
void appendTail(int node)
{
if(queue1.size()==0 && queue2.size()==0)
{
queue1.push(node);
}
else if(queue1.size()>0)
{
queue1.push(node);
}
else if(queue2.size()>0)
{
queue2.push(node);
}
}
int deleteHead()
{
int t=0;
if(queue2.size()==0)
{
while(queue1.size()!=1)
{
queue2.push(queue1.front());
queue1.pop();
}
t=queue1.front();
queue1.pop();
}
else
{
while(queue2.size()!=1)
{
queue1.push(queue2.front());
queue2.pop();
}
t=queue2.front();
queue2.pop();
}
return t;
}
private:
queue<int> queue1;
queue<int> queue2;
};
int main()
{
CStack s;
s.appendTail(1);
s.appendTail(2);
s.appendTail(3);
cout<<s.deleteHead()<<endl;
}