【数据结构】其八:队列之链队列——2022/01/15
#include <stdio.h>
#include <stdlib.h>
typedef struct qnode *LinkQue;
typedef struct qnode
{
int data;
LinkQue next;
LinkQue front;
LinkQue rear;
} LinkListQ;
LinkQue q;
LinkQue InitQueue()
{
LinkQue q;
LinkQue p;
q = (LinkQue)malloc(sizeof(LinkListQ));
p = (LinkQue)malloc(sizeof(LinkListQ));
q->front = p;
q->rear = p;
printf("链队列初始化完成!\n");
return q;
}
int EmptyQue(LinkQue q)
{
if (q->front == q->rear)
{
printf("队空!\n");
return 1;
}
else
{
return 0;
}
}
void InQue(LinkQue q, int x)
{
LinkQue p;
p = (LinkQue)malloc(sizeof(LinkListQ));
p->data = x;
p->next = NULL;
q->rear->next = p;
q->rear = p;
}
int OutQue(LinkQue q, int *x)
{
LinkQue p;
if (EmptyQue(q))
{
return 0;
}
else
{
p = q->front->next;
*x = p->data;
q->front->next = p->next;
if (p->next == NULL)
{
q->rear = q->front;
}
free(p);
return 1;
}
}
int GetFront(LinkQue q, int *x)
{
if (EmptyQue(q))
{
return 0;
}
else
{
*x = q->front->next->data;
return 1;
}
}
void ShowQueue(LinkQue q)
{
LinkQue p = q->front->next;
if (p!=NULL)
{
printf("自队列元素起各元素为:");
while (p != NULL)
{
printf("%5d", p->data);
p = p->next;
}
printf("\n");
}
}
void menu()
{
printf("\t链队列的各种操作:\n");
printf("==============================\n");
printf("\t1----建立链队列\n");
printf("\t2----入队操作\n");
printf("\t3----出队操作\n");
printf("\t4----求队头元素\n");
printf("\t5----显示队列中元素\n");
printf("==============================\n");
}
int main()
{
int n, x;
int num = 1;
while (num)
{
menu();
printf("请输入菜单号:\n");
scanf("%d", &num);
switch (num)
{
case 0:
break;
case 1:
q = InitQueue();
break;
case 2:
printf("请输入进队元素的个数:\t");
scanf("%d", &n);
printf("请输入%d个整数进行入队:\n", n);
for (int i = 0; i < n; i++)
{
scanf("%d", &x);
InQue(q, x);
}
printf("入队完毕!\n");
break;
case 3:
printf("请输入出队元素的个数:\t");
scanf("%d", &n);
printf("出队元素数量为:%d\n", n);
for (int i = 0; i < n; i++)
{
OutQue(q, &x);
printf("%5d", x);
}
printf("\t出队完毕!\n");
break;
case 4:
GetFront(q, &x);
printf("当前的队头元素值为:%d\n", x);
break;
case 5:
ShowQueue(q);
break;
default:
printf("请输入0-5的数!\n");
break;
}
}
}