两个栈实现一个队列

#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
#include<stack>

template<class T>
class Queue
{
public:
void Push(const T& x)
{
_stack1.push(x);
}
void Pop()
{
if (_stack2.size() <= 0)
{
if (!_stack1.empty())
{
T& data = _stack1.top();
_stack1.pop();
_stack2.push(data);
}

}
if (_stack2.empty())
{
cout << "queue is empty!" << endl;
return;
}
_stack2.pop();
}

private:
stack<T> _stack1;
stack<T> _stack2;
};

void test()
{
Queue<int> q;
q.Push(1);
q.Push(2);
q.Push(3);
q.Push(4);
q.Push(5);
q.Pop();
q.Pop();
q.Pop();
q.Pop();
q.Pop();
}

int main()
{
test();
system("pause");
return 0;
}