-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path2024.3.25.c
73 lines (67 loc) · 1.06 KB
/
2024.3.25.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int datatype;
#define maxsize 5
typedef struct queue
{
datatype data[maxsize];
int front;
int rear;
int size;
}queue;
void inqueue(queue* q)
{
if (q->size >= maxsize)
{
printf("队列已满\n");
return;
}
printf("输入想要入队的元素\n");
datatype element;
scanf("%d", &element);
q->data[q->rear] = element;
q->rear++;
q->size++;
}
datatype outqueue(queue* q)
{
if (q->size == 0)
{
printf("empty\n");
exit(1);
}
datatype temp;
temp = q->data[q->front];
q->front = (q->front + 1) % maxsize;
q->size--;
return temp;
}
int main()
{
queue q;
q.front = 0;
q.rear = 0;
q.size = 0;
int i = 0;
int n;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
inqueue(&q);
}
printf("有几个要出队?\n");
int number;
scanf("%d", &number);
for (i = 0; i < number; i++)
{
printf("%d ", outqueue(&q));
}
for (i = 0; i < number; i++)
{
inqueue(&q);
}
return 0;
}