C语言循环队列

stack.h

#define N 5
typedef struct Queue_s {
	int data[N];
	int front;
	int rear;
} Queue_t, *pQueue_t;

void init(pQueue_t pQueue);
int isFull(pQueue_t pQueue);
void enQueue(pQueue_t pQueue, int num);
int isEmpty(pQueue_t pQueue);
int deQueue(pQueue_t pQueue);
1
2
3
4
5
6
7
8
9
10
11
12

main.c

#define _CRT_SECURE_NO_WARNINGS
#include 
#include 
#include 
#include "queue.h"
int main() {
	Queue_t queue;
	init(&queue);
	for (int i = 0; i < 5; ++i) {
		printf("enQueue, i = %d\n", i);
		enQueue(&queue, i);
	}
	for (int i = 0; i < 6; ++i) {
		printf("deQueue, out = %d\n", deQueue(&queue));
	}
}
void init(pQueue_t pQueue) {
	memset(pQueue, 0, sizeof(Queue_t));
}
int isFull(pQueue_t pQueue) {
	return (pQueue->rear + 1) % N == pQueue->front;
}
void enQueue(pQueue_t pQueue, int num) {
	if (isFull(pQueue)) {
		fprintf(stderr, "Queue is full!\n");
		return;
	}
	pQueue->data[pQueue->rear] = num;
	pQueue->rear = (pQueue->rear + 1) % N;
}
int isEmpty(pQueue_t pQueue) {
	return pQueue->rear == pQueue->front;
}
int deQueue(pQueue_t pQueue) {
	if (isEmpty(pQueue)) {
		fprintf(stderr, "Queue is empty!\n");
		return -1;
	}
	int ret = pQueue->data[pQueue->front];
	pQueue->front = (pQueue->front + 1) % N;
	return ret;
}
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