用C语言写一个循环存储的策略
时间: 2023-10-10 07:14:08 浏览: 34
当使用C语言编写循环存储策略时,我们可以使用数组来实现。以下是一个示例代码,演示如何使用循环存储策略来实现一个简单的队列。
```c
#include <stdio.h>
#define MAX_SIZE 10
typedef struct {
int data[MAX_SIZE];
int front;
int rear;
} CircularQueue;
void initQueue(CircularQueue *queue) {
queue->front = -1;
queue->rear = -1;
}
int isQueueEmpty(CircularQueue *queue) {
return (queue->front == -1 && queue->rear == -1);
}
int isQueueFull(CircularQueue *queue) {
return ((queue->rear + 1) % MAX_SIZE == queue->front);
}
void enqueue(CircularQueue *queue, int item) {
if (isQueueFull(queue)) {
printf("Queue is full. Cannot enqueue.\n");
return;
}
if (isQueueEmpty(queue)) {
queue->front = 0;
queue->rear = 0;
} else {
queue->rear = (queue->rear + 1) % MAX_SIZE;
}
queue->data[queue->rear] = item;
}
int dequeue(CircularQueue *queue) {
if (isQueueEmpty(queue)) {
printf("Queue is empty. Cannot dequeue.\n");
return -1;
}
int item = queue->data[queue->front];
if (queue->front == queue->rear) {
// If there was only one element in the queue
queue->front = -1;
queue->rear = -1;
} else {
queue->front = (queue->front + 1) % MAX_SIZE;
}
return item;
}
int main() {
CircularQueue queue;
initQueue(&queue);
enqueue(&queue, 5);
enqueue(&queue, 10);
enqueue(&queue, 15);
printf("Dequeued item: %d\n", dequeue(&queue));
printf("Dequeued item: %d\n", dequeue(&queue));
printf("Dequeued item: %d\n", dequeue(&queue));
return 0;
}
```
这段代码实现了一个循环队列,利用数组的循环存储特性来实现入队和出队操作。你可以根据需要修改 `MAX_SIZE` 宏定义来调整队列的最大容量。