1,队列模型
队列的基本操作是:入队和出队。入队就是在表的末端(rear)处插入一个元素。出队就是在表的开头(front)位置删除一个元素。
sizeofquene 即队列的大小。 front 为队头制作 rear 是队尾指针。
typedef struct AlignMent* Quene;
struct AlignMent {
int array[SizeOfQuene];
//数组
int Front;
//指向首元素的位置,队头
int Rear;
//指向最后一个元素的位置,队尾
int Size;
//队列中元素的个数
};
下面讨论空队列的指针(队头队尾)指向位置问题。
2,front = 0 rear = 0
在清华大学数据结构书中循环队列的初始定义为: rear = front = 0
在这种情况下:
队列为空的条件: q.Size == 0 或 q.Front == q.Rear
int IsEmpty(Quene s)
//判断队列是否为空
{
return s->Size == 0;
}
队列为满的条件: q.Size + 1 == sizeofquene 或 (q.Rear+1)%sizeofquene == q.Front
int IsFull(Quene s)
//判断队列是否满
{
return (s->Rear + 1) % SizeOfQuene == s->Front;
}
插入元素:先判断是否为满,若不满则操作
void EnQueue(Quene s, int x)
//将x元素入队
{
if (IsFull(s) != 0)
{
printf("队列满了已经,请不要再执行入队操作");
exit(0);
}
else {
s->Rear = (s->Rear + 1) % SizeOfQuene;
s->array[s->Rear] = x;
s->Size++;
}
}
删除元素-出队:
int DeQueue(Quene s)
//出队操作
{
int k = 0;
if (IsEmpty(s) != 0)
{
printf("队列已经空了,无法执行出队操作");
exit(0);
}
else {
s->Front = (s->Front + 1) % SizeOfQuene;
k = s->array[s->Front];
s->array[s->Front] = 0;
}
s->Size--;
return k;
}
重点是:这种情况下:front 上面是没有数据元素的。这是细节在出队的时候。
3, front = 1 rear = 0
在数据结构与算法分析书中循环队列的初始定义为:rear = 0 , front = 1
理论上这样也是可以的呗。
在这种情况下:
队列为空的条件: q.Size == 0 或 q.Front == q.Rear + 1&&q.size==0
队列为满的条件: q.Size == sizeofquene 或 (q.rear+1)%sizeofquene==q.front&&q.size!=0
入队和出队操作是一样的。
注意:这种情况下,front上面也是有元素的,所以是可以比上面的多存储一个元素的。自己可以画图看看
代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define SIZEOFQUEUE 10
typedef struct AlignMent* Queue;
struct AlignMent {
int Array[SIZEOFQUEUE];
int Front;
int Rear;
int Size;
};
void Initialize(Queue s)
//初始化队列
{
s->Front = 1;
s->Rear = 0;
s->Size = 0;
}
int IFEmpty(Queue s)
//判断是否为空
{
return s->Size == 0;
//return (s->rear+1)%sizeofqueue == s->front &&s.size==0
}
int IFFUll(Queue s)
//判断是否满
{
return (s->Rear + 1) % SIZEOFQUEUE == s->Front && s->Size != 0;
}
int Dequeue(Queue s)
//删除,出队列
{
int k = 0;
if (IFEmpty(s) != 0)
{
printf("error in out");
exit(0);
}
else
{
k = s->Array[s->Front];
s->Array[s->Front] = 0;
s->Front = (s->Front + 1) % SIZEOFQUEUE;
s->Size--;
}
return k;
}
void PrintQuene(Queue s)
//打印出队列
{
printf("目前队列情况为:\n");
printf("front=%d rear=%d size=%d\n", s->Front, s->Rear, s->Size);
if (s->Size != 0) {
if (s->Front <= s->Rear)
{
int i = s->Front;
for (; i <= s->Rear; i++)
printf("%d ", s->Array[i]);
}
else {
int i = s->Front;
for (; i < SIZEOFQUEUE; i++)
printf("%d ", s->Array[i]);
for (i = 0; i <= s->Rear; i++)
printf("%d ", s->Array[i]);
}
}
else {
printf("it's null\n");
}
printf("\n");
}
void MakeEmpty(Queue s)
//使得队列变为空队列
{
if (s->Front <= s->Rear)
{
while (s->Front <= s->Rear)
{
s->Array[s->Front] = 0;
s->Front++;
}
}
else {
while (s->Front < SIZEOFQUEUE)
{
s->Array[s->Front] = 0;
s->Front++;
}
while (s->Rear >= 0)
{
s->Array[s->Rear] = 0;
s->Rear--;
}
}
s->Front = 0;
s->Rear = 0;
s->Size = 0;
}
void EnQueue(Queue s,int x)
//入队
{
if (IFFUll(s) != 0)
{
printf("error in in,it's full");
exit(0);
}
else {
s->Rear = (s->Rear + 1) % SIZEOFQUEUE;
s->Array[s->Rear] = x;
s->Size++;
}
}
int main()
{
Queue s = malloc(sizeof(struct AlignMent));
Initialize(s);
//建立并初始化队列(
printf("welcome use this producer\n");
printf("输入格式为:a\n");
printf("a如果为0则表示出队,a为1则表示入队操作,请继续输入入队的数\n");
printf("a如果为123则表示停止操作,输出队列\n");
int a = 0;
scanf("%d", &a);
while (a != 123)
{
if (a == 0)
//出队
{
printf("出队的数是:%d\n", Dequeue(s));
}
else if (a == 1)
{
int b = 0;
printf("请输入要入队的数:\n");
scanf("%d", &b);
EnQueue(s, b);
}
PrintQuene(s);
printf("请继续输入指令a:");
scanf("%d", &a);
}
printf("最终的队列情况为:\n");
PrintQuene(s);
printf("如果想清空队列,请输入数字0,如果想保存,则输入数字1\n");
printf("请输入:");
int c = 0;
scanf("%d", &c);
if (c == 0) {
MakeEmpty(s);
printf("队列清空成功\n");
}
printf("最终的队列为:\n");
PrintQuene(s);
printf("bye~");
return 0;
}