build

chapter_stack_and_queue/queue.md

@@ -195,7 +195,7 @@ comments: true
 === "C"
 
     ```c title="queue.c"
-    
+    // C 未提供内置队列
     ```
 
 === "C#"
@@ -679,7 +679,87 @@ comments: true
 === "C"
 
     ```c title="linkedlist_queue.c"
-    [class]{linkedListQueue}-[func]{}
+    /* 基于链表实现的队列 */
+    struct linkedListQueue {
+        ListNode *front, *rear;
+        int queSize;
+    };
+
+    /* 构造函数 */
+    linkedListQueue *newLinkedListQueue() {
+        linkedListQueue *queue = (linkedListQueue *)malloc(sizeof(linkedListQueue));
+        queue->front = NULL;
+        queue->rear = NULL;
+        queue->queSize = 0;
+        return queue;
+    }
+
+    /* 析构函数 */
+    void delLinkedListQueue(linkedListQueue *queue) {
+        // 释放所有节点
+        for (int i = 0; i < queue->queSize && queue->front != NULL; i++) {
+            ListNode *tmp = queue->front;
+            queue->front = queue->front->next;
+            free(tmp);
+        }
+        // 释放 queue 结构体
+        free(queue);
+    }
+
+    /* 获取队列的长度 */
+    int size(linkedListQueue *queue) {
+        return queue->queSize;
+    }
+
+    /* 判断队列是否为空 */
+    bool empty(linkedListQueue *queue) {
+        return (size(queue) == 0);
+    }
+
+    /* 入队 */
+    void push(linkedListQueue *queue, int num) {
+        // 尾节点处添加 node
+        ListNode *node = newListNode(num);
+        // 如果队列为空，则令头、尾节点都指向该节点
+        if (queue->front == NULL) {
+            queue->front = node;
+            queue->rear = node;
+        }
+        // 如果队列不为空，则将该节点添加到尾节点后
+        else {
+            queue->rear->next = node;
+            queue->rear = node;
+        }
+        queue->queSize++;
+    }
+
+    /* 访问队首元素 */
+    int peek(linkedListQueue *queue) {
+        assert(size(queue) && queue->front);
+        return queue->front->val;
+    }
+
+    /* 出队 */
+    void pop(linkedListQueue *queue) {
+        int num = peek(queue);
+        ListNode *tmp = queue->front;
+        queue->front = queue->front->next;
+        free(tmp);
+        queue->queSize--;
+    }
+
+    /* 打印队列 */
+    void printLinkedListQueue(linkedListQueue *queue) {
+        int arr[queue->queSize];
+        // 拷贝链表中的数据到数组
+        int i;
+        ListNode *node;
+        for (i = 0, node = queue->front; i < queue->queSize && queue->front != queue->rear; i++) {
+            arr[i] = node->val;
+            node = node->next;
+        }
+        printArray(arr, queue->queSize);
+    }
     ```
 
 === "C#"
@@ -1371,7 +1451,82 @@ comments: true
 === "C"
 
     ```c title="array_queue.c"
-    [class]{arrayQueue}-[func]{}
+    /* 基于环形数组实现的队列 */
+    struct arrayQueue {
+        int *nums;       // 用于存储队列元素的数组
+        int front;       // 队首指针，指向队首元素
+        int queSize;     // 尾指针，指向队尾 + 1
+        int queCapacity; // 队列容量
+    };
+
+    /* 构造函数 */
+    arrayQueue *newArrayQueue(int capacity) {
+        arrayQueue *queue = (arrayQueue *)malloc(sizeof(arrayQueue));
+        // 初始化数组
+        queue->queCapacity = capacity;
+        queue->nums = (int *)malloc(sizeof(int) * queue->queCapacity);
+        queue->front = queue->queSize = 0;
+        return queue;
+    }
+
+    /* 析构函数 */
+    void delArrayQueue(arrayQueue *queue) {
+        free(queue->nums);
+        queue->queCapacity = 0;
+    }
+
+    /* 获取队列的容量 */
+    int capacity(arrayQueue *queue) {
+        return queue->queCapacity;
+    }
+
+    /* 获取队列的长度 */
+    int size(arrayQueue *queue) {
+        return queue->queSize;
+    }
+
+    /* 判断队列是否为空 */
+    bool empty(arrayQueue *queue) {
+        return queue->queSize == 0;
+    }
+
+    /* 访问队首元素 */
+    int peek(arrayQueue *queue) {
+        assert(size(queue) != 0);
+        return queue->nums[queue->front];
+    }
+
+    /* 入队 */
+    void push(arrayQueue *queue, int num) {
+        if (size(queue) == capacity(queue)) {
+            printf("队列已满\r\n");
+            return;
+        }
+        // 计算队尾指针，指向队尾索引 + 1
+        // 通过取余操作，实现 rear 越过数组尾部后回到头部
+        int rear = (queue->front + queue->queSize) % queue->queCapacity;
+        // 将 num 添加至队尾
+        queue->nums[rear] = num;
+        queue->queSize++;
+    }
+
+    /* 出队 */
+    void pop(arrayQueue *queue) {
+        int num = peek(queue);
+        // 队首指针向后移动一位，若越过尾部则返回到数组头部
+        queue->front = (queue->front + 1) % queue->queCapacity;
+        queue->queSize--;
+    }
+
+    /* 打印队列 */
+    void printArrayQueue(arrayQueue *queue) {
+        int arr[queue->queSize];
+        // 拷贝
+        for (int i = 0, j = queue->front; i < queue->queSize; i++, j++) {
+            arr[i] = queue->nums[j % queue->queCapacity];
+        }
+        printArray(arr, queue->queSize);
+    }
     ```
 
 === "C#"