空间上:
插入1234后:
通过对front和rear的不断对max_size(即队列的大小)整除,得到一个循环
#include<malloc.h>
#define max_size 5
typedef struct circlequeue
{
int data[max_size];
int front;
int rear;
}cq,*cqptr;
cqptr init()
{
cqptr p=(cqptr)malloc(sizeof(cq));
p->front = p->rear = 0;
return p;
}
void enqueue(cqptr p,int data)
{
if(p->front == (p->rear + 1) % max_size)
{
printf("queue is full\n");
return;
}
p->rear++;
p->data[p->rear%max_size] = data;//刚开始存储的时候data[0]是空的,且rear的位置会一直在第一个元素前一位
}
void print(cqptr p)
{
int flag = 0;
for (int i = p->front+1; i <= p->rear; i++)
{
printf("%d", p->data[i % max_size]);
flag = 1;
}
if (flag == 0)
{
printf("queue is empty");
}
printf("\n");
}
void dequeue(cqptr p)
{
if (p->front == p->rear)
{
printf("queue is empty\n");
return;
}
p->front++;
}
int main()
{
cqptr p = init();
for (int i = 1; i < 5; i++)
{
enqueue(p, i);
}
print(p);
for (int i = 1; i < 5; i++)
{
dequeue(p);
print(p);
}
}
运行结果:
1234
234
34
4
queue is empty