这个也简单!基础就只是一个数组,关键就是把两个指针搞明白就结束了!
思路:为了 避免“假溢出”现象,重复利用出队与入队的空间;我们大量使用取余操作,并且特意空出一个位置来避免判不清是队空还是队满的情况。
具体操作:入队的时候是尾指针rear在往后移动,出队是front指针在往后移动,当相差一个时,队满,或rear加1取余后等于front,则队满。
循环队列:只要没有满,我就可以通过取余把它塞满;
结构体与初始化:pass
typedef struct {
int front, rear;
int data[max_size];
}CircleQue,*CircleQuePtr;
CircleQuePtr Init() {
CircleQuePtr C_Que = (CircleQuePtr)malloc(sizeof(CircleQue) * max_size);
C_Que->front = 0;
C_Que->rear = 0;
return C_Que;
}
入队:上已经说到,特意留一空间是来判是否队满或队空,然后通过rear的取余来寻找前边已经出队或还没有赋值的位置。
void enque(CircleQuePtr C_Que,int data) {
if ((C_Que->rear + 1) % max_size == C_Que->front) {
printf("no space \n");
return;
}
C_Que->data[C_Que->rear%max_size] = data;
C_Que->rear++;
}
出队:因为当出值时,front++,故全部出队后,front会等于rear,此为队空条件!
int deque(CircleQuePtr C_Que) {
if (C_Que->front == C_Que->rear) {
printf("NULL\n");
return -1;
}
int tempdata = C_Que->data[C_Que->front%max_size];
C_Que->front++;
return tempdata;
}
输出队列值: 1.队空条件判断
2.此处while循环可单纯改为for循环,因为front和rear都是一直在增加,操作都是通过取余完成的;故自然front<rear,取余既为对于下标!!!
void output(CircleQuePtr C_Que) {
if (C_Que->front == C_Que->rear) {
printf("empty!");
return;
}
while (1) {
printf("%d ", C_Que->data[C_Que->front%max_size]);
C_Que->front++;
if (C_Que->front == max_size) C_Que->front = 0;
if (C_Que->front == C_Que->rear) break;
}
}
完整代码:(自信的人从不贴运行截图!)
#include<stdio.h>
#include<malloc.h>
#define max_size 10
typedef struct {
int front, rear;
int data[max_size];
}CircleQue,*CircleQuePtr;
CircleQuePtr Init() {
CircleQuePtr C_Que = (CircleQuePtr)malloc(sizeof(CircleQue) * max_size);
C_Que->front = 0;
C_Que->rear = 0;
return C_Que;
}
void enque(CircleQuePtr C_Que,int data) {
if ((C_Que->rear + 1) % max_size == C_Que->front) {
printf("no space \n");
return;
}
C_Que->data[C_Que->rear%max_size] = data;
C_Que->rear++;
}
int deque(CircleQuePtr C_Que) {
if (C_Que->front == C_Que->rear) {
printf("NULL\n");
return -1;
}
int tempdata = C_Que->data[C_Que->front%max_size];
C_Que->front++;
return tempdata;
}
void output(CircleQuePtr C_Que) {
if (C_Que->front == C_Que->rear) {
printf("empty!");
return;
}
while (1) {
printf("%d ", C_Que->data[C_Que->front%max_size]);
C_Que->front++;
if (C_Que->front == max_size) C_Que->front = 0;
if (C_Que->front == C_Que->rear) break;
}
}
void test() {
CircleQuePtr C_Que = Init();
int a[] = { 1,3,5,7,9,2,4,6,8 };
for (int i = 0; i < 5; i++) {
enque(C_Que, a[i]);
}
deque(C_Que);
deque(C_Que);
for (int i = 6; i <8 ; i++) {
enque(C_Que, i);
}
output(C_Que);
}
int main() {
test();
return 0;
}