【LeetCode】Medium | 622. 设计循环队列

题目

代码

typedef struct {
	int* arry; 
	int front;
	int tail;
	int size;//数组大小
} MyCircularQueue;
bool myCircularQueueIsEmpty(MyCircularQueue* obj);
bool myCircularQueueIsFull(MyCircularQueue* obj);
MyCircularQueue* myCircularQueueCreate(int k)
 {
    MyCircularQueue* cq=(MyCircularQueue*)malloc(sizeof(MyCircularQueue));
    cq->arry = (int*)malloc(sizeof(int) * (k+1));
	cq->front = cq->tail = 0;
	cq->size = k;
    return cq;
}

bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) {
	if (myCircularQueueIsFull(obj))
        return false;
	obj->arry[obj->tail] = value;
	obj->tail = (obj->tail + 1) % (obj->size + 1);
    return true;
}

bool myCircularQueueDeQueue(MyCircularQueue* obj) {
	if (myCircularQueueIsEmpty(obj))
        return false;
	obj->front = (obj->front + 1) % (obj->size + 1);
    return true;
}

int myCircularQueueFront(MyCircularQueue* obj) {
	if (myCircularQueueIsEmpty(obj))
        return -1;
	return obj->arry[obj->front];
}

int myCircularQueueRear(MyCircularQueue* obj) {
	if (myCircularQueueIsEmpty(obj))
        return -1;
	int tail_i = (obj->tail + obj->size) % (obj->size + 1);
	return obj->arry[tail_i];
}

bool myCircularQueueIsEmpty(MyCircularQueue* obj) {

	return obj->front == obj->tail;
}

bool myCircularQueueIsFull(MyCircularQueue* obj) {
	return (obj->tail + 1) % (obj->size + 1) == obj->front;
}

void myCircularQueueFree(MyCircularQueue* obj) {
	free(obj->arry);
	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);
*/