SCAU 数据结构 8584 循环队列的基本操作

小白蹦蹦跳跳

于 2022-06-17 14:57:44 发布

阅读量459

点赞数 1

分类专栏： 2022SCAU数据结构文章标签：数据结构 c语言链表

本文链接：https://blog.csdn.net/m0_62122789/article/details/125333635

版权

2022SCAU数据结构专栏收录该内容

32 篇文章 12 订阅

订阅专栏

Description
创建一个空的循环队列，并实现入队、出队、返回队列的长度、返回队头元素、队列的遍历等基本算法。请将下面的程序补充完整。

#include<malloc.h>
#include<stdio.h>
#define OK 1
#define ERROR 0
typedef int Status; // Status是函数的类型,其值是函数结果状态代码，如OK等
typedef int QElemType;
#define MAXQSIZE 100 // 最大队列长度(对于循环队列，最大队列长度要减1)

typedef struct
{
QElemType *base; // 初始化的动态分配存储空间
int front; // 头指针,若队列不空,指向队列头元素
int rear; // 尾指针,若队列不空,指向队列尾元素的下一个位置
}SqQueue;

Status InitQueue(SqQueue &Q)
{
// 构造一个空队列Q，该队列预定义大小为MAXQSIZE
// 请补全代码

}

Status EnQueue(SqQueue &Q,QElemType e)
{
// 插入元素e为Q的新的队尾元素
// 请补全代码

}

Status DeQueue(SqQueue &Q, QElemType &e)
{
// 若队列不空, 则删除Q的队头元素, 用e返回其值, 并返回OK; 否则返回ERROR
// 请补全代码

}

Status GetHead(SqQueue Q, QElemType &e)
{
// 若队列不空，则用e返回队头元素，并返回OK，否则返回ERROR
// 请补全代码

}

int QueueLength(SqQueue Q)
{
// 返回Q的元素个数
// 请补全代码

}

Status QueueTraverse(SqQueue Q)
{
// 若队列不空，则从队头到队尾依次输出各个队列元素，并返回OK；否则返回ERROR.
int i;
i=Q.front;
if()printf(“The Queue is Empty!”); //请填空
else{
printf("The Queue is: ");
while() //请填空
{
printf(“%d “,______________________ ); //请填空
i = ______________________; //请填空
}
}
printf(”\n”);
return OK;
}

int main()
{
int a;
SqQueue S;
QElemType x, e;
if() // 判断顺序表是否创建成功，请填空
{
printf(“A Queue Has Created.\n”);
}
while(1)
{
printf(“1:Enter \n2:Delete \n3:Get the Front \n4:Return the Length of the Queue\n5:Load the Queue\n0:Exit\nPlease choose:\n”);
scanf(“%d”,&a);
switch(a)
{
case 1: scanf(“%d”, &x);
if() printf(“Enter Error!\n”); // 判断入队是否合法，请填空
else printf(“The Element %d is Successfully Entered!\n”, x);
break;
case 2: if() printf(“Delete Error!\n”); // 判断出队是否合法，请填空
else printf(“The Element %d is Successfully Deleted!\n”, e);
break;
case 3: if()printf(“Get Head Error!\n”); // 判断Get Head是否合法，请填空
else printf(“The Head of the Queue is %d!\n”, e);
break;
case 4: printf(“The Length of the Queue is %d!\n”,______________________); //请填空
break;
case 5: ______________________ //请填空
break;
case 0: return 1;
}
}
}

输入格式
测试样例格式说明：
根据菜单操作：
1、输入1，表示要实现入队操作，紧跟着输入要入队的元素
2、输入2，表示要实现出队操作
3、输入3，返回队头元素
4、输入4，返回队列的元素个数
5、输入5，表示从队头到队尾输出队的所有元素
6、输入0，表示程序结束

输入样例
1
1
1
2
1
3
5
2
3
5
0

输出样例
A Queue Has Created.
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Element 1 is Successfully Entered!
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Element 2 is Successfully Entered!
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Element 3 is Successfully Entered!
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Queue is: 1 2 3
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Element 1 is Successfully Deleted!
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Head of the Queue is 2!
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:
The Queue is: 2 3
1:Enter
2:Delete
3:Get the Front
4:Return the Length of the Queue
5:Load the Queue
0:Exit
Please choose:

#include <malloc.h>
#include <stdio.h>
#define MAXQSIZE 100
#define OK 1
#define ERROR 0

using namespace std;

typedef int Status;

typedef int QElemType;

//初始化
typedef struct
{
    QElemType *base;
    int front;
    int rear;
}SqQueue;

//创建空队列
Status InitQueue(SqQueue &Q)
{
    Q.base=new QElemType[MAXQSIZE];
    Q.front=Q.rear=0;
    return OK;
}

//入队
Status EnQueue(SqQueue &Q,QElemType e)
{
    if((Q.rear+1)%MAXQSIZE==Q.front) return ERROR;
    Q.base[Q.rear]=e;
    Q.rear=(Q.rear+1)%MAXQSIZE;
    return OK;
}

//出队
Status DeQueue(SqQueue &Q,QElemType &e)
{
    if(Q.rear==Q.front) return ERROR;
    e=Q.base[Q.front];
    Q.front=(Q.front+1)%MAXQSIZE;
    return OK;
}

//取对头元素
Status GetHead(SqQueue &Q,QElemType &e)
{
    if(Q.front==Q.rear) return ERROR;
    e=Q.base[Q.front];
    return OK;
}

//求队列元素个数
Status QueueLength(SqQueue &Q)
{
    return (Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;
}

//遍历输出队列元素
Status QueueTraverse(SqQueue &Q)
{
    int i;
    i=Q.front;
    if(QueueLength(Q)==0) return ERROR;
    else{
        printf("The Queue is: ");
        while(i!=Q.rear)
        {
            printf("%d ",Q.base[i]);
            i=(i+1)%MAXQSIZE;
        }
    }
    printf("\n");
    return OK;
}

int main()
{
	int a;
    SqQueue S;
	QElemType x, e;
    if(InitQueue(S))    // 判断顺序表是否创建成功，请填空
	{
		printf("A Queue Has Created.\n");
	}
	while(1)
	{
	printf("1:Enter \n2:Delete \n3:Get the Front \n4:Return the Length of the Queue\n5:Load the Queue\n0:Exit\nPlease choose:\n");
		scanf("%d",&a);
		switch(a)
		{
			case 1: scanf("%d", &x);
				  if(!EnQueue(S,x)) printf("Enter Error!\n"); // 判断入队是否合法，请填空
				  else printf("The Element %d is Successfully Entered!\n", x);
				  break;
			case 2: if(!DeQueue(S,e)) printf("Delete Error!\n"); // 判断出队是否合法，请填空
				  else printf("The Element %d is Successfully Deleted!\n", e);
				  break;
			case 3: if(!GetHead(S,e))printf("Get Head Error!\n"); // 判断Get Head是否合法，请填空
				  else printf("The Head of the Queue is %d!\n", e);
				  break;
			case 4: printf("The Length of the Queue is %d!\n",QueueLength(S));  //请填空
				  break;
			case 5: QueueTraverse(S); //请填空
				  break;
			case 0: return 1;
		}
	}
}