数据结构之队列----先进先出
自定义模板:
#pragma once
#include<assert.h>
#include<iostream>
using namespace std;
const int newSize = 20;
const int maxSize = 50;
template<class T>
class SeqQueue //顺序队列类
{
public :
SeqQueue(int sz = 10);//默认创建队列大小为10个位置
~SeqQueue(){ delete[]elements;}
bool EnQueue(const T& x);
//若队列不满,则将x进队,否则队溢出处理
bool DeQueue(T& x);
//若队列不空,则删除队头元素X并由函数返回true,否则队空,返回false.
bool getFront(T& x) const;
//队列不为空,返回true,并且将队头元素传给参数X,否则返回false
void makeEmpty() { front = rear = 0; }//队列置空
bool IsEmpty()const { return (front == rear) ? true : false; }
bool IsFull()const { return ((rear + 1) % maxSize == front) ? true : false; }
int getSize()const { return (rear - front + maxSize) % maxSize; }
void print();
protected:
int rear, front;//假指针,用来标记位置 rear:队尾,front:队首
T *elements;
int maxSize;//队列最大可容纳元素个数
void reSize(int newSize);//队列满了后的扩展操作
};
template<class T>
void SeqQueue<T>::print() {
cout << "front=" << front << ",rear=" << rear << endl;
for (int i = front; i != rear; i = ((i + 1) % maxSize))
cout << i << ":" << elements[i] << endl;
}
template<class T>
SeqQueue<T>::SeqQueue(int sz) :front(0), rear(0), maxSize(sz) {
elements = new T[maxSize];
assert(elements != NULL);
};
template<class T>
bool SeqQueue<T>::EnQueue(const T& x) {
if (IsFull() == true)
{
cout << "队列空间已经装满,自动扩展"<<newSize<<"个元素"<<endl;
reSize(newSize);
}
elements[rear] = x;
rear = (rear + 1) % maxSize;
return true;
};
template<class T>
bool SeqQueue<T>::DeQueue(T& x) {
if (IsEmpty() == true) return false;//此时队列已经空了
x = elements[front];
front = (front + 1) % maxSize;
return true;
};
template<class T>
bool SeqQueue<T>::getFront(T& x)const {
if (IsEmpty() == true) return false;
x = elements[front];
return true;
};
template<class T>
void SeqQueue<T>::reSize(int newSize)//默认是对表的扩展
{
if (newSize <= 0)
{
cerr << "数组大小不能为负值" << endl; return;
}
newSize = newSize + maxSize;//只是动态增加,不是一次性扩展很大很大
if (newSize != maxSize)//空间大小相等无意义
{
T* newarray = new T[newSize];
if (newarray == NULL)
{
cerr << "存储分配错误" << endl; exit(1);
}
for (int i = 0; i < maxSize; i++)
{
newarray[i] = elements[i];//复制拷贝
}
delete[]elements;
elements = newarray;
maxSize = newSize;
}
};
主函数测试:
#include<iostream>
#include"SeqQueue.h"
using namespace std;
int main() {
SeqQueue<int>q;
for(int i=1;i<=9;i++)//顺序添加9个元素
q.EnQueue(i);
q.print();//输出当前队列内容
cout << "当前队列元素个数:" << q.getSize()<<endl;
q.EnQueue(99);//入队一个新元素,判断自动扩展是否生效
q.print();
cout << "当前队列元素个数:" << q.getSize() << endl;;
int x;
q.DeQueue(x);
cout << "删除队列首位元素:"<<x<<endl;
cout << "删除后队列内容:" << endl;
q.print();
cout << "当前队列元素个数:" << q.getSize()<<endl;
return 0;
}
输出样例: