两个栈实现一个队列,两个队列实现一个栈

上图:

//两个栈实现一个队列
template
class CQueue
{
public:
CQueue(void);
~CQueue(void);
void appendTail(const T& node);
T deleteHead();
private:
stack stack1;
stack stack2;
};
template
CQueue::CQueue(void){}
template
CQueue::~CQueue(void){}
template
void CQueue::appendTail(const T& node)
{
stack1.push(node);
}
template
T CQueue::deleteHead()
{
if(stack2.size()<=0)//s2不为空
{
while(stack1.size()>0)//s1不为空
{
T& p=stack1.top();
stack1.pop();
stack2.push§;
}
}
if(stack2.size()==0)//s2为空,抛出异常
{
throw new exception(“queue is empty!”);
}
T& head=stack2.top();
stack2.pop();
return head;
}
int main()
{
CQueue que;
que.appendTail(1);
que.appendTail(2);
que.appendTail(3);
que.appendTail(4);
int head=que.deleteHead();
cout<<head<<endl;
int head1=que.deleteHead();
cout<<head1<<endl;
int head2=que.deleteHead();
cout<<head2<<endl;
int head3=que.deleteHead();
cout<<head3<<endl;
}
//两个队列模拟一个栈
template
class CStack
{
public:
CStack(void);
~CStack(void);
void Append(const T& node);
T deleteHead();
private:
queue que1;
queue que2;
};
template
CStack::CStack(void){}
template
CStack::~CStack(void){}
template
void CStack::Append(const T& node)
{
if(!que1.empty())
{
que1.push(node);
}
else
{
que2.push(node);
}
}
template
T CStack::deleteHead()
{
int r=0;
if(!que1.empty())
{
int num=que1.size();
while(num>1)
{
que2.push(que1.front());
que1.pop();
–num;
}
r=que1.front();
que1.pop();
}
else
{
int num=que2.size();
while(num>1)
{
que1.push(que2.front());
que2.pop();
–num;
}
r=que2.front();
que2.pop();
}
return r;
}
int main()
{
CStack st;
st.Append(1);
st.Append(2);
st.Append(3);
st.Append(4);
int head1=st.deleteHead();
cout<<head1<<endl;
int head2=st.deleteHead();
cout<<head2<<endl;
int head3=st.deleteHead();
cout<<head3<<endl;
int head4=st.deleteHead();
cout<<head4<<endl;
}