利用C++ 单向链表实现数据结构队列,仅仅是插入的时候在链表的尾部插入,取元素都是一样的,都从头部取。
//2016.5.24 c++实现链式队列。
#include <iostream>
using namespace std;
template <typename T>
class qnode //链式节点类
{
public:
T data;
qnode <T> *next;
};
//struct qNode
//{
// T data;
// qNode<T> *next;
//};
template <typename T>
class Lqueue
{
qnode <T> *front; //指向队列头节点的指针,头结点不存元素,队列头节点才开始存元素,
qnode <T> *rear;//指向队列尾节点的指针,尾节点存元素
int length;
public:
Lqueue();
~Lqueue();
bool IsEmpty();
void Clear();
int GetLength();
int GetHead(T &e);//获取头节点值,赋给e.
bool EnQueue(T e);//e入队
bool DeQueue(T &e);//出队,赋给e
void TraverseQueue();//从头遍历队列
};
template <typename T>
Lqueue<T>::Lqueue() // 构造函数
{
front = new qnode<T>;//指向新节点,
if (!front)
{
cout << "申请内存失败" << endl;
}
front->next = NULL;
front = rear;
length = 0;
}
template <typename T>
Lqueue<T>::~Lqueue() //析构函数,销毁队列,释放内存
{
while (front)
{
rear= front->next;//队列头节点下一个节点赋给rear,避免分配一个临时节点,节省内存
delete front;//这里front表示的是节点
front = rear;//这里front表示的是指针
}
}
template <class T>
int Lqueue<T>::GetLength()
{
return length;
}
template < typename T>
bool Lqueue<typename T>::IsEmpty()
{
if (length == 0)
return true;
else
return false;
}
template < typename T>
void Lqueue<typename T>::Clear()//只是清空元素,不释放内存
{
while (front != rear)
{
front->next = front->next->next;
}
front = rear = NULL;
length = 0;
}
template <typename T>
int Lqueue<typename T>::GetHead(T &e)
{
if (front == rear)
cout << "队列为空" << endl;
e = front->next->data;
return e;
}
template <typename T>
bool Lqueue <typename T>::EnQueue(T e)//从尾部入队
{
int length = 0;
qnode<T> *q = new qnode<T>;
if (!q) return false;
q->data = e; //搞定新节点的数据域和指针域,
q->next = NULL;
rear->next = q; //让新节点成为原来为节点的后继
rear = q; //尾指针指向新节点,成为尾节点
length++;
return true;
}
template <typename T>
bool Lqueue<T>::DeQueue(T &e)
{
int length;
if (front == rear)
cout << "队列是空的" << endl;
return false;
e = front->next->data;
qnode<T> *temp = front->next;
front->next = front->next->next;//头结点的指针指向出队元素的下一个节点
delete temp;
length--;
return true;
}
template <typename T>
void Lqueue<T>::TraverseQueue()
{
cout << "--------------------------------------" << endl;
cout << "从头开始遍历" << endl;
qnode<T> *p = front->next;
while (p)
{
cout<< p->data<<endl;
p = p->next;
}
cout << "--------------------------------------" << endl;
}
void test()
{
char e;
Lqueue<char> Q;
int m;
cin >> m;
while (m != 3)
{
switch (m)
{
case 1:
{
char t;
cout << "请输入要入队的字母元素" << endl;
cin >> t;
Q.EnQueue(t);
Q.TraverseQueue();
cout << "此时队列长度为" << Q.GetLength() << endl;
break;
}
case 2:
{
Q.DeQueue(e);
Q.TraverseQueue();
cout<<"此时队列的长度为:" << Q.GetLength() << endl;
break;
}
default:
break;
}
cout << "---- 操作提示:" << endl;
cout << "---- 1 :进队操作"<<endl;;
cout << "---- 2 :出队操作" << endl;
cout << "---- 3 :退出!" << endl;
cout << "请选择你需要的操作:" << endl;
cout << "\b\b" << endl;
cin >>m;
}
}
void main()
{
cout << "---- 操作提示:" << endl;
cout << "---- 1 :进队操作" << endl;
cout << "---- 2 :出队操作" << endl;
cout << "---- 3 :退出!" << endl;
cout << "请选择你需要的操作:[ ]";
cout << "\b\b";
test();
}