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

#include<iostream>
#include<vector>
#include<string.h>
#include<list>
using namespace std;

template<typename T>class CQueue
{
public:
	CQueue(void);
	~CQueue(void);

	void appendTail(const T& node);
	T deletHead();

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)//只有当stack2中为空的时候，才可以入栈
	{
		while (stack1.size() >= 0)//将stack1中的元素取出，放入stack2中
		{
			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;
}