Go最新【LeetCode刷题日记】[641(1)，2024年最新覆盖所有面试知识点

2401_84925002

于 2024-05-17 04:02:46 发布

阅读量921

点赞数 13

分类专栏：面试学习路线阿里巴巴文章标签： go 学习面试

本文链接：https://blog.csdn.net/2401_84925002/article/details/138985466

版权

面试同时被 3 个专栏收录

12 篇文章 0 订阅

订阅专栏

学习路线

12 篇文章 0 订阅

订阅专栏

阿里巴巴

12 篇文章 0 订阅

订阅专栏

网上学习资料一大堆，但如果学到的知识不成体系，遇到问题时只是浅尝辄止，不再深入研究，那么很难做到真正的技术提升。

需要这份系统化的资料的朋友，可以添加戳这里获取

一个人可以走的很快，但一群人才能走的更远！不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人，都欢迎加入我们的的圈子（技术交流、学习资源、职场吐槽、大厂内推、面试辅导），让我们一起学习成长！

        return -1;
    }
    // 当 rear 为 0 时防止数组越界
    return arr[(rear - 1 + capacity) % capacity];
}

/** Checks whether the circular deque is empty or not. */
bool isEmpty() {
    return front == rear;
}

/** Checks whether the circular deque is full or not. */
bool isFull() {
    // 注意：这个设计是非常经典的做法
    return (rear + 1) % capacity == front;
}

};

/**

Your MyCircularDeque object will be instantiated and called as such:
MyCircularDeque* obj = new MyCircularDeque(k);
bool param_1 = obj->insertFront(value);
bool param_2 = obj->insertLast(value);
bool param_3 = obj->deleteFront();
bool param_4 = obj->deleteLast();
int param_5 = obj->getFront();
int param_6 = obj->getRear();
bool param_7 = obj->isEmpty();
bool param_8 = obj->isFull();
*/

typedef struct NODE{
int val;
struct NODE* pre;
struct NODE* next;
} MyNode;

typedef struct {
int size;
int cursize;
MyNode* head;
MyNode* tail;
} MyCircularDeque;

/** Initialize your data structure here. Set the size of the deque to be k. */

MyCircularDeque* myCircularDequeCreate(int k) {
MyCircularDeque* MyDeque = calloc(k, sizeof(MyCircularDeque));
MyDeque->head = NULL;
MyDeque->tail = NULL;
MyDeque->size = k;
MyDeque->cursize = 0;
return MyDeque;
}

/** Adds an item at the front of Deque. Return true if the operation is successful. /
bool myCircularDequeInsertFront(MyCircularDeque obj, int value) {
if (obj->size == obj->cursize) {
return false;
}
MyNode* node = calloc(1,sizeof(MyNode));
node->val = value;
if (obj->head == NULL) {
obj->head = node;
obj->tail = node;
} else {
obj->head->pre = node;
node->next = obj->head;
node->pre = NULL;
obj->head = node;
}
obj->cursize++;
return true;
}

/** Adds an item at the rear of Deque. Return true if the operation is successful. /
bool myCircularDequeInsertLast(MyCircularDeque obj, int value) {
if (obj->size == obj->cursize) {
return false;
}
MyNode* node = calloc(1,sizeof(MyNode));
node->val = value;
if (obj->head == NULL) {
obj->head = node;
obj->tail = node;
} else {
node->next = NULL;
obj->tail->next = node;
node->pre = obj->tail;
node->next = NULL;
obj->tail = node;
}
obj->cursize++;
return true;
}

/** Deletes an item from the front of Deque. Return true if the operation is successful. /
bool myCircularDequeDeleteFront(MyCircularDeque obj) {
if (obj->cursize == 0) {
return false;
}
if (obj->cursize == 1) {
free(obj->head);
obj->head = NULL;
obj->tail = NULL;
} else {
MyNode* temp = obj->head;
obj->head = temp->next;
obj->head->pre = NULL;
free(temp);
}
obj->cursize–;
return true;
}

/** Deletes an item from the rear of Deque. Return true if the operation is successful. /
bool myCircularDequeDeleteLast(MyCircularDeque obj) {
if (obj->cursize == 0) {
return false;
}
if (obj->cursize == 1) {
free(obj->head);
obj->head = NULL;
obj->tail = NULL;
} else {
MyNode* temp = obj->tail;
obj->tail = temp->pre;
obj->tail->next = NULL;
free(temp);
}
obj->cursize–;
return true;
}

/** Get the front item from the deque. /
int myCircularDequeGetFront(MyCircularDeque obj) {
if (obj->cursize == 0) {
return -1;
}
return obj->head->val;
}

/** Get the last item from the deque. /
int myCircularDequeGetRear(MyCircularDeque obj) {
if (obj->cursize == 0) {
return -1;
}
return obj->tail->val;
}

/** Checks whether the circular deque is empty or not. /
bool myCircularDequeIsEmpty(MyCircularDeque obj) {
if (obj->cursize == 0) {
return true;
}
return false;
}

/** Checks whether the circular deque is full or not. /
bool myCircularDequeIsFull(MyCircularDeque obj) {
if (obj->size == obj->cursize) {
return true;
}
return false;
}

void myCircularDequeFree(MyCircularDeque* obj) {
if (obj == NULL) {
return ;
}
MyNode* temp = obj->head;
while (temp) {
MyNode* temp1 = temp;
temp = temp->next;
free(temp1);
}
free(obj);
obj = NULL;
}

/**