#include <stdio.h>
#include <stdlib.h>
#define MAX 6
typedef struct {
int *data;
int rear; //尾“指针”,指向队列尾元素的下一个位置
int front; //头“指针”,指向队列头元素
}SqQueue;
void Init_Queue(SqQueue *Q) {
Q->data = (int *)malloc(MAX * sizeof(int));
Q->front = Q->rear = 0;
}
void Add_Queue(SqQueue *Q, int e) {
if ((Q->rear + 1) % MAX == Q->front) {
printf("Full!\n");
}
else {
Q->data[Q->rear] = e;
Q->rear = (Q->rear + 1) % MAX;
}
}
void Delet_Queue(SqQueue *Q, int *e) {
if (Q->front == Q->rear) {
printf("Empty!\n");
}
else {
*e = Q->data[Q->front];
Q->front = (Q->front + 1) % MAX;
}
}
void Print_Queue(SqQueue Q) {
for (; Q.front < Q.rear; Q.front++) {
printf("%d\n", Q.data[Q.front]);
}
}
int main() {
SqQueue queue;
Init_Queue(&queue);
int num = 0;
do {
printf("Input numbers\n");
scanf("%d", &num);
if (num != -1) {
Add_Queue(&queue, num);
}
} while (num != -1);
Print_Queue(queue);
return 0;
}
循环队列
最新推荐文章于 2021-12-02 00:36:59 发布