用链表做的队列
先进先出
使用C++模板类
动态数组做可能会浪费空间,但是链表的利用率就比较高,今天用链表做一个队列。
在VS2013中新建项目,在头文件中加入QueueLi.h在原文件中加入main.cpp
//QueueLi.h
#ifndef QUEUELI_H
#define QUEUELI_H
template<class Object>
class Queue{
public:
Queue();
~Queue();
bool isEmpty() const;
const Object & getFront() const;
void enqueue(const Object & x);
Object dequeue();
void makeEmpty();
private:
struct ListNode{
Object element;
ListNode * next;
ListNode(const Object & theElement, ListNode *n = 0)
:element(theElement), next(n){}
};
ListNode *front;
ListNode *back;
};
template<class Object>
Queue<Object>::Queue(){
front = back = 0;
}
template<class Object>
Queue<Object>::~Queue(){
makeEmpty();
}
template<class Object>
void Queue<Object>::makeEmpty(){
while (!isEmpty())
dequeue();
}
template<class Object>
bool Queue<Object>::isEmpty()const{
return front == 0;
}
template<class Object>
const Object & Queue<Object>::getFront()const{
if (isEmpty())
throw "Queue is empty.";
return front->element;
}
template <class Object>
void Queue<Object>::enqueue(const Object &x){
if (isEmpty())
back = front = new ListNode(x);
else
back = back->next = new ListNode(x);
}
template<class Object>
Object Queue<Object>::dequeue(){
Object frontItem = getFront();
ListNode *old = front;
front = front->next;
delete old;
return frontItem;
}
#endif
//main.cpp
#include<iostream>
#include"QueueLi.h"
using namespace std;
int main(){
cout << "测试链式队列:" << endl;
Queue<int> myQ;
myQ.enqueue(10);
myQ.enqueue(20);
myQ.enqueue(30);
cout << myQ.getFront() << endl;
myQ.dequeue();
cout << myQ.getFront() << endl;
cout << myQ.dequeue() << endl;
cout << myQ.dequeue() << endl;
for (int j = 0; j < 8; j++){
for (int i = 0; i < 8; i++){
myQ.enqueue(i);
}
while (!myQ.isEmpty())
cout << myQ.dequeue() << endl;
}
system("pause");
return 0;
}
总结:使用数组和使用链表做队列速度都差不多,但是链表的代码量比较少,而且链表占用的内存也比较少。