文章目录
设计循环队列
下面是队列提供的接口函数
typedef struct {
int* a;
int k;
int front;
int rear;
} MyCircularQueue;
MyCircularQueue* myCircularQueueCreate(int k) {
MyCircularQueue* Queue = (MyCircularQueue*)malloc(sizeof(MyCircularQueue));
if(Queue==NULL)
{
perror("malloc fail");
return NULL;
}
Queue->a = malloc(sizeof(int)*(k+1));
Queue->k=k;
Queue->front = Queue->rear=0;
return Queue;
}
bool myCircularQueueIsEmpty(MyCircularQueue* obj) {
return obj->rear == obj->front;
}
bool myCircularQueueIsFull(MyCircularQueue* obj) {
return (obj->rear+1)%(obj->k+1)==obj->front;
}
bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) {
if(myCircularQueueIsFull(obj))
return false;
else
{
obj->a[obj->rear]=value;
obj->rear++;
obj->rear%=(obj->k+1);
}
return true;
}
bool myCircularQueueDeQueue(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return false;
else
{
obj->front++;
obj->front%=(obj->k+1);
}
return true;
}
int myCircularQueueFront(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return -1;
else
return obj->a[obj->front];
}
int myCircularQueueRear(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return -1;
else
return obj->a[(obj->rear-1+obj->k+1)%(obj->k+1)];
}
void myCircularQueueFree(MyCircularQueue* obj) {
free(obj->a);
free(obj);
}
一、循环队列的构建
typedef struct {
int* a;
int k;
int front;
int rear;
} MyCircularQueue;
MyCircularQueue* myCircularQueueCreate(int k) {
MyCircularQueue* Queue = (MyCircularQueue*)malloc(sizeof(MyCircularQueue));
if(Queue==NULL)
{
perror("malloc fail");
return NULL;
}
Queue->a = malloc(sizeof(int)*(k+1));
Queue->k=k;
Queue->front = Queue->rear=0;
return Queue;
}
二、判断是否为空
1.没有元素的情况下
2.有元素的情况下
bool myCircularQueueIsEmpty(MyCircularQueue* obj) {
return obj->rear == obj->front;
}
三、判断队列是否满了
1.第一种情况
2.第二种情况
bool myCircularQueueIsFull(MyCircularQueue* obj) {
return (obj->rear+1)%(obj->k+1)==obj->front;
}
四、队列插入
bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) {
if(myCircularQueueIsFull(obj))
return false;
else
{
obj->a[obj->rear]=value;
obj->rear++;
obj->rear%=(obj->k+1);
}
return true;
}
五、队列的删除
bool myCircularQueueDeQueue(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return false;
else
{
obj->front++;
obj->front%=(obj->k+1);
}
return true;
}
六、队列取头尾
int myCircularQueueFront(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return -1;
else
return obj->a[obj->front];
}
int myCircularQueueRear(MyCircularQueue* obj) {
if(myCircularQueueIsEmpty(obj))
return -1;
else
return obj->a[(obj->rear-1+obj->k+1)%(obj->k+1)];
}