剑指offer面试题7：用两个栈实现队列

#include "iostream"
#include <string>
#include "stack"
using namespace std;
template <typename T> class cQueue{
public:
void appendTail(const T ¬es);
T deleteHead();
private:
stack<T> stack1;
stack<T> stack2;
};
template <typename T> void cQueue<T>::appendTail(const T ¬es)
{
stack1.push(notes);
}
template <typename T> T cQueue<T>::deleteHead()
{
if (stack2.size()<=0)
{
while (stack1.size()>0)
{
T &data = stack1.top();
stack1.pop();
stack2.push(data);
}
}
if (stack2.size() == 0)
throw new exception("queue is empty");
T head = stack2.top();
stack2.pop();
return head;
}
int main()
{
cQueue<int> queue;
queue.appendTail(1);
queue.appendTail(2);
queue.appendTail(3);
queue.deleteHead();
queue.appendTail(6);
queue.deleteHead();
system("pause");
return 0;
}