方法:
typedef struct {
int k;
int front;
int rear;
int* arr;
} MyCircularQueue;
MyCircularQueue* myCircularQueueCreate(int k) {
MyCircularQueue* q =
(MyCircularQueue*)malloc(sizeof(MyCircularQueue));
q->arr = (int*)malloc(sizeof(int) * (k + 1));
q->front = q->rear = 0;
q->k = k;
return q;
}
bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) {
if((obj->rear + 1) % (obj->k + 1) == obj->front)
{
return false;
}
else
{
obj->arr[obj->rear % (obj->k + 1)] = value;
obj->rear++;
return true;
}
}
bool myCircularQueueDeQueue(MyCircularQueue* obj) {
if(obj->front % (obj->k+1) == obj->rear % (obj->k+1))
{
return false;
}
else
{
obj->front++;
return true;
}
}
int myCircularQueueFront(MyCircularQueue* obj) {
if(obj->rear % (obj->k + 1) == obj->front % (obj->k + 1))
{
return -1;
}
else{
return obj->arr[obj->front % (obj->k + 1)];
}
}
int myCircularQueueRear(MyCircularQueue* obj) {
if(obj->rear % (obj->k + 1) == obj->front % (obj->k + 1))
{
return -1;
}
else
{
return obj->arr[(obj->rear + obj->k) % (obj->k + 1)];
}
}
bool myCircularQueueIsEmpty(MyCircularQueue* obj) {
return obj->rear % (obj->k + 1) == obj->front % (obj->k + 1)
? true : false;
}
bool myCircularQueueIsFull(MyCircularQueue* obj) {
return (obj->rear + 1) % (obj->k + 1) == obj->front % (obj->k + 1)
? true : false;
}
void myCircularQueueFree(MyCircularQueue* obj) {
free(obj->arr);
free(obj);
}
/**
* Your MyCircularQueue struct will be instantiated and called as such:
* MyCircularQueue* obj = myCircularQueueCreate(k);
* bool param_1 = myCircularQueueEnQueue(obj, value);
* bool param_2 = myCircularQueueDeQueue(obj);
* int param_3 = myCircularQueueFront(obj);
* int param_4 = myCircularQueueRear(obj);
* bool param_5 = myCircularQueueIsEmpty(obj);
* bool param_6 = myCircularQueueIsFull(obj);
* myCircularQueueFree(obj);
*/
思路:
用数组创建一个循环队列,并且记录队列的头下标和尾下标。
入队时尾下标+1,出队时头下标+1。
为了区分队列空和满两种情况,创建队列时需要多创建一个空间。
当头下标和尾下标同一位置时队列为空。
当尾下标在头下标前一个位置时队列为满。