题目:用两个栈实现一个队列。队列声明如下,请实现它的两个函数appendTail和deleteHead,分别完成在队列尾部插入结点和在队列头部删除结点的功能。
#include <exception>
#include <iostream>
#include <stack>
using namespace std;
template <typename T> class CQueue {
public:
CQueue(void);
~CQueue(void);
void appendTail(const T &node);
T deleteHead();
private:
stack<T> stack1;
stack<T> stack2;
};
template <typename T> void CQueue<T>::appendTail(const T &node) {
stack1.push(node);
}
template <typename T> T CQueue<T>::deleteHead() {
if (stack2.size() <= 0) {
while (!stack1.empty()) {
T &data = stack1.top();
stack1.pop();
stack2.push(data);
}
}
T data = stack2.top();
stack2.pop();
return data;
}
int main() {
CQueue<int> s;
int a;
cin >> a;
while (a > 0) {
s.appendTail(a);
}
cout << s.deleteHead() << endl;
return 0;
}