#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 10
//创建顺序队列(不浪费空间使用操作标志符)
typedef struct
{
int data[MAXSIZE];
int front, rear, tag; //头指正,尾指针,队列操作标志
}SqQueue;
void InsertData(SqQueue *s);
void ViewData(SqQueue *s);
void DeleteData(SqQueue *s);
int main()
{
SqQueue *s = (SqQueue*)malloc(sizeof(SqQueue)); //动态申请
s->front = s->rear = s->tag = 0; //列表初始化,置为空状态
InsertData(s);
ViewData(s);
DeleteData(s);
ViewData(s);
free(s);
return 0;
}
//添加数据
void InsertData(SqQueue *s)
{
int data;
while(1)
{
if(s->front == s->rear && s->tag == 1) //判断队列是否已满
{
printf("当前队列已满!\n");
break;
}else
{
printf("当前队列已有%d个数据,请输入要添加的数据:", (s->rear + MAXSIZE - s->front)%MAXSIZE);
scanf("%d", &data);
if(data != 9999)
{
s->data[s->rear] = data; //先存放数据,再将rear+1
s->rear = (s->rear + 1)%MAXSIZE;
s->tag = 1; //添加添加成功后将操作符置为1
printf("添加成功!\n");
}else
{
printf("添加结束!\n");
break;
}
}
}
}
void DeleteData(SqQueue *s)
{
if(s->front == s->rear && s->tag == 0) //判断队列是否为空
{
printf("队列为空,无数据!\n");
}else
{
char a;
int i;
//当队列不为空时,分为存满数据以及为存满数据
if(s->front == s->rear)
{
i = MAXSIZE;
while(i >= 0)
{
printf("当前队头元素为%d,是否确认删除? Y/N\n", s->data[s->front]);
scanf("%s", &a);
if(a == 'Y')
{
s->front = (s->front + 1)%MAXSIZE; //逻辑上删除数据
s->tag = 0; //删除操作完成,将标志符置为0
i--;
}
else
{
printf("删除结束\n");
break;
}
}
}else
{
while((s->rear + MAXSIZE - s->front) % MAXSIZE > 0) //为存满数据时通过((s->rear + MAXSIZE - s->front) % MAXSIZE)求得当前队列数据个数
{
printf("当前队头元素为%d,是否确认删除? Y/N\n", s->data[s->front]);
scanf("%s", &a);
if(a == 'Y')
{
s->front = (s->front + 1)%MAXSIZE; //逻辑上删除数据
s->tag = 0; //删除操作完成,将标志符置为0
}
else
{
printf("删除结束\n");
break;
}
}
}
}
}
//遍历队列
void ViewData(SqQueue *s)
{
if(s->front == s->rear && s->tag == 0) //判断是否为空
{
printf("队列为空,无数据!\n");
}else
{
int j = 1, i = s->front;
while(i != s->rear)
{
printf("队列第%d个,值为%d!\n", j++, s->data[i]);
i = (i+1)%MAXSIZE; //i = front,通过i的增加遍历队列
}
}
}
感觉使用tag标志的不好找队列当前个数,必须要判断满没有满。
可能是我太弱了,哈哈哈。