用两个栈实现队列
解析:队列的特性是“先进先出”,栈的特性是“后进先出”,在下面的程序中,模拟实现队列的两个函数分别实现队列尾部插入结点和在队列头部删除结点的功能。
具体实现方法和过程,看下面的gif图:
完整代码及测试用例:
#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> CQueue<T>::CQueue(void)
{
}
template <typename T> CQueue<T>::~CQueue(void)
{
}
//队尾插入元素
template<typename T> void CQueue<T>::appendTail(const T& element)
{
stack1.push(element);
}
//队头删除元素
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)
cout << "queue is empty!";
T head = stack2.top();
stack2.pop();
return head;
}
void Test(char actual, char expected)
{
if (actual == expected)
cout << "Test passed." << endl;
else
cout << "Test failed." << endl;
}
int main()
{
CQueue<char> queue;
queue.appendTail('a');
queue.appendTail('b');
queue.appendTail('c');
char head = queue.deleteHead();
Test(head, 'a');
head = queue.deleteHead();
Test(head, 'b');
queue.appendTail('d');
head = queue.deleteHead();
Test(head, 'c');
queue.appendTail('e');
head = queue.deleteHead();
Test(head, 'd');
head = queue.deleteHead();
Test(head, 'e');
system("pause");
return 0;
}
运行结果:
Test passed.
Test passed.
Test passed.
Test passed.
Test passed.
请按任意键继续. . .