diff --git a/.gitignore b/.gitignore index c960a1bb..52026b06 100644 --- a/.gitignore +++ b/.gitignore @@ -4,7 +4,9 @@ # Editor .vscode/ .idea/ +cmake-build-debug/ hello-algo.iml +*.dSYM/ # mkdocs files site/ diff --git a/.prettierrc b/.prettierrc deleted file mode 100644 index 5a938ce1..00000000 --- a/.prettierrc +++ /dev/null @@ -1,4 +0,0 @@ -{ - "tabWidth": 4, - "useTabs": false -} diff --git a/Dockerfile b/Dockerfile new file mode 100644 index 00000000..f699e33e --- /dev/null +++ b/Dockerfile @@ -0,0 +1,16 @@ +FROM python:3.9.0-alpine + +RUN pip install -i https://pypi.tuna.tsinghua.edu.cn/simple --upgrade pip +RUN pip install -i https://pypi.tuna.tsinghua.edu.cn/simple mkdocs-material==9.0.2 + +WORKDIR /app + +COPY codes /app/codes +COPY docs /app/docs +COPY mkdocs.yml /app/mkdocs.yml + +RUN mkdir ./docs/overrides && mkdocs build + +EXPOSE 8000 + +CMD ["mkdocs", "serve", "-a", "0.0.0.0:8000"] diff --git a/codes/c/CMakeLists.txt b/codes/c/CMakeLists.txt new file mode 100644 index 00000000..1a208dd9 --- /dev/null +++ b/codes/c/CMakeLists.txt @@ -0,0 +1,12 @@ +cmake_minimum_required(VERSION 3.10) +project(hello_algo C) + +set(CMAKE_C_STANDARD 11) + +include_directories(./include) + +add_subdirectory(include) +add_subdirectory(chapter_computational_complexity) +add_subdirectory(chapter_array_and_linkedlist) +add_subdirectory(chapter_sorting) +add_subdirectory(chapter_tree) diff --git a/codes/c/chapter_array_and_linkedlist/CMakeLists.txt b/codes/c/chapter_array_and_linkedlist/CMakeLists.txt new file mode 100644 index 00000000..dfa3322f --- /dev/null +++ b/codes/c/chapter_array_and_linkedlist/CMakeLists.txt @@ -0,0 +1,2 @@ +add_executable(array array.c) +add_executable(linked_list linked_list.c) \ No newline at end of file diff --git a/codes/c/chapter_array_and_linkedlist/linked_list.c b/codes/c/chapter_array_and_linkedlist/linked_list.c new file mode 100644 index 00000000..a8de0873 --- /dev/null +++ b/codes/c/chapter_array_and_linkedlist/linked_list.c @@ -0,0 +1,88 @@ +/** + * File: linked_list.c + * Created Time: 2022-01-12 + * Author: Zero (glj0@outlook.com) + */ + +#include "../include/include.h" + +/* 在链表的结点 n0 之后插入结点 P */ +void insert(ListNode* n0, ListNode* P) { + ListNode *n1 = n0->next; + n0->next = P; + P->next = n1; +} + +/* 删除链表的结点 n0 之后的首个结点 */ +// 由于引入了 stdio.h ，此处无法使用 remove 关键词 +// 详见 https://github.com/krahets/hello-algo/pull/244#discussion_r1067863888 +void removeNode(ListNode* n0) { + if (!n0->next) + return; + // n0 -> P -> n1 + ListNode *P = n0->next; + ListNode *n1 = P->next; + n0->next = n1; + // 释放内存 + free(P); +} + +/* 访问链表中索引为 index 的结点 */ +ListNode* access(ListNode* head, int index) { + while (head && head->next && index) { + head = head->next; + index--; + } + return head; +} + +/* 在链表中查找值为 target 的首个结点 */ +int find(ListNode* head, int target) { + int index = 0; + while (head) { + if (head->val == target) + return index; + head = head->next; + index++; + } + return -1; +} + + +/* Driver Code */ +int main() { + /* 初始化链表 */ + // 初始化各个结点 + ListNode* n0 = newListNode(1); + ListNode* n1 = newListNode(3); + ListNode* n2 = newListNode(2); + ListNode* n3 = newListNode(5); + ListNode* n4 = newListNode(4); + // 构建引用指向 + n0->next = n1; + n1->next = n2; + n2->next = n3; + n3->next = n4; + printf("初始化的链表为\r\n"); + printLinkedList(n0); + + /* 插入结点 */ + insert(n0, newListNode(0)); + printf("插入结点后的链表为\r\n"); + printLinkedList(n0); + + /* 删除结点 */ + removeNode(n0); + printf("删除结点后的链表为\r\n"); + printLinkedList(n0); + + /* 访问结点 */ + ListNode* node = access(n0, 3); + printf("链表中索引 3 处的结点的值 = %d\r\n", node->val); + + /* 查找结点 */ + int index = find(n0, 2); + printf("链表中值为 2 的结点的索引 = %d\r\n", index); + + return 0; +} diff --git a/codes/c/chapter_computational_complexity/CMakeLists.txt b/codes/c/chapter_computational_complexity/CMakeLists.txt new file mode 100644 index 00000000..d9e55dcf --- /dev/null +++ b/codes/c/chapter_computational_complexity/CMakeLists.txt @@ -0,0 +1,2 @@ +add_executable(time_complexity time_complexity.c ) +add_executable(worst_best_time_complexity worst_best_time_complexity.c) \ No newline at end of file diff --git a/codes/c/chapter_computational_complexity/time_complexity.c b/codes/c/chapter_computational_complexity/time_complexity.c index b8821ec6..ee827ed1 100644 --- a/codes/c/chapter_computational_complexity/time_complexity.c +++ b/codes/c/chapter_computational_complexity/time_complexity.c @@ -56,11 +56,13 @@ int bubbleSort(int *nums, int n) { for (int i = n - 1; i > 0; i--) { // 内循环：冒泡操作 for (int j = 0; j < i; j++) { - // 交换 nums[j] 与 nums[j + 1] - int tmp = nums[j]; - nums[j] = nums[j + 1]; - nums[j + 1] = tmp; - count += 3; // 元素交换包含 3 个单元操作 + if (nums[j] > nums[j + 1]) { + // 交换 nums[j] 与 nums[j + 1] + int tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; + count += 3; // 元素交换包含 3 个单元操作 + } } } return count; diff --git a/codes/c/chapter_computational_complexity/worst_best_time_complexity.c b/codes/c/chapter_computational_complexity/worst_best_time_complexity.c index 2570ff3c..e5cee821 100644 --- a/codes/c/chapter_computational_complexity/worst_best_time_complexity.c +++ b/codes/c/chapter_computational_complexity/worst_best_time_complexity.c @@ -49,6 +49,5 @@ int main(int argc, char *argv[]) { nums = NULL; } } - getchar(); return 0; } diff --git a/codes/c/chapter_sorting/CMakeLists.txt b/codes/c/chapter_sorting/CMakeLists.txt new file mode 100644 index 00000000..192e1cb9 --- /dev/null +++ b/codes/c/chapter_sorting/CMakeLists.txt @@ -0,0 +1,2 @@ +add_executable(bubble_sort bubble_sort.c) +add_executable(insertion_sort insertion_sort.c) \ No newline at end of file diff --git a/codes/c/chapter_sorting/bubble_sort.c b/codes/c/chapter_sorting/bubble_sort.c index 5c74d9e4..51bab6c6 100644 --- a/codes/c/chapter_sorting/bubble_sort.c +++ b/codes/c/chapter_sorting/bubble_sort.c @@ -7,7 +7,7 @@ #include "../include/include.h" /* 冒泡排序 */ -void bubble_sort(int nums[], int size) { +void bubbleSort(int nums[], int size) { // 外循环：待排序元素数量为 n-1, n-2, ..., 1 for (int i = 0; i < size - 1; i++) { @@ -25,7 +25,7 @@ void bubble_sort(int nums[], int size) { } /* 冒泡排序（标志优化）*/ -void bubble_sort_with_flag(int nums[], int size) { +void bubbleSortWithFlag(int nums[], int size) { // 外循环：待排序元素数量为 n-1, n-2, ..., 1 for (int i = 0; i < size - 1; i++) { @@ -50,15 +50,15 @@ void bubble_sort_with_flag(int nums[], int size) { /* Driver Code */ int main() { int nums[6] = {4, 1, 3, 1, 5, 2}; - printf("冒泡排序后:\n"); - bubble_sort(nums, 6); + printf("冒泡排序后: "); + bubbleSort(nums, 6); for (int i = 0; i < 6; i++) { printf("%d ", nums[i]); } - printf("优化版冒泡排序后:\n"); - bubble_sort_with_flag(nums, 6); + printf("\n优化版冒泡排序后: "); + bubbleSortWithFlag(nums, 6); for (int i = 0; i < 6; i++) { printf("%d ", nums[i]); diff --git a/codes/c/chapter_sorting/insertion_sort.c b/codes/c/chapter_sorting/insertion_sort.c index 80e8b127..f81b8d43 100644 --- a/codes/c/chapter_sorting/insertion_sort.c +++ b/codes/c/chapter_sorting/insertion_sort.c @@ -28,7 +28,7 @@ void insertionSort(int nums[], int size) { int main() { int nums[] = {4, 1, 3, 1, 5, 2}; insertionSort(nums, 6); - printf("插入排序完成后 nums = \n"); + printf("插入排序完成后 nums = "); for (int i = 0; i < 6; i++) { printf("%d ", nums[i]); diff --git a/codes/c/chapter_tree/CMakeLists.txt b/codes/c/chapter_tree/CMakeLists.txt new file mode 100644 index 00000000..779315b7 --- /dev/null +++ b/codes/c/chapter_tree/CMakeLists.txt @@ -0,0 +1,4 @@ +add_executable(binary_search binary_tree.c) +add_executable(binary_tree_bfs binary_tree_bfs.c) +add_executable(binary_tree_dfs binary_tree_dfs.c) +add_executable(binary_search_tree binary_search_tree.c) diff --git a/codes/c/chapter_tree/binary_search_tree.c b/codes/c/chapter_tree/binary_search_tree.c new file mode 100644 index 00000000..f993faec --- /dev/null +++ b/codes/c/chapter_tree/binary_search_tree.c @@ -0,0 +1,8 @@ +/** + * File: binary_search_tree.c + * Created Time: 2023-01-11 + * Author: Reanon (793584285@qq.com) + */ + +#include "../include/include.h" + diff --git a/codes/c/chapter_tree/binary_tree.c b/codes/c/chapter_tree/binary_tree.c new file mode 100644 index 00000000..1eb8e846 --- /dev/null +++ b/codes/c/chapter_tree/binary_tree.c @@ -0,0 +1,42 @@ +/** + * File: binary_tree.c + * Created Time: 2023-01-11 + * Author: Reanon (793584285@qq.com) + */ + +#include "../include/include.h" + +/* Driver Code */ +int main() { + /* 初始化二叉树 */ + // 初始化结点 + TreeNode* n1 = newTreeNode(1); + TreeNode* n2 = newTreeNode(2); + TreeNode* n3 = newTreeNode(3); + TreeNode* n4 = newTreeNode(4); + TreeNode* n5 = newTreeNode(5); + // 构建引用指向（即指针） + n1->left = n2; + n1->right = n3; + n2->left = n4; + n2->right = n5; + printf("初始化二叉树\n"); + printTree(n1); + + /* 插入与删除结点 */ + TreeNode* P = newTreeNode(0); + // 在 n1 -> n2 中间插入结点 P + n1->left = P; + P->left = n2; + printf("插入结点 P 后\n"); + printTree(n1); + + // 删除结点 P + n1->left = n2; + // 释放内存 + free(P); + printf("删除结点 P 后\n"); + printTree(n1); + + return 0; +} diff --git a/codes/c/chapter_tree/binary_tree_bfs.c b/codes/c/chapter_tree/binary_tree_bfs.c new file mode 100644 index 00000000..c7b83b91 --- /dev/null +++ b/codes/c/chapter_tree/binary_tree_bfs.c @@ -0,0 +1,66 @@ +/** + * File: binary_tree_bfs.c + * Created Time: 2023-01-11 + * Author: Reanon (793584285@qq.com) + */ + +#include "../include/include.h" + +/* 层序遍历 */ +int *levelOrder(TreeNode *root, int *size) { + /* 辅助队列 */ + int front, rear; + int index, *arr; + TreeNode *node; + TreeNode **queue; + + /* 辅助队列 */ + queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE); + // 队列指针 + front = 0, rear = 0; + // 加入根结点 + queue[rear++] = root; + // 初始化一个列表，用于保存遍历序列 + /* 辅助数组 */ + arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE); + // 数组指针 + index = 0; + while (front < rear) { + // 队列出队 + node = queue[front++]; + // 保存结点 + arr[index++] = node->val; + if (node->left != NULL) { + // 左子结点入队 + queue[rear++] = node->left; + } + if (node->right != NULL) { + // 右子结点入队 + queue[rear++] = node->right; + } + } + // 更新数组长度的值 + *size = index; + arr = realloc(arr, sizeof(int) * (*size)); + return arr; +} + + +/* Driver Code */ +int main() { + /* 初始化二叉树 */ + // 这里借助了一个从数组直接生成二叉树的函数 + int nums[] = {1, 2, 3, NIL, 5, 6, NIL}; + int size = sizeof(nums) / sizeof(int); + TreeNode *root = arrToTree(nums, size); + printf("初始化二叉树\n"); + printTree(root); + + /* 层序遍历 */ + // 需要传入数组的长度 + int *arr = levelOrder(root, &size); + printf("层序遍历的结点打印序列 = "); + printArray(arr, size); + + return 0; +} \ No newline at end of file diff --git a/codes/c/chapter_tree/binary_tree_dfs.c b/codes/c/chapter_tree/binary_tree_dfs.c new file mode 100644 index 00000000..bafc90fd --- /dev/null +++ b/codes/c/chapter_tree/binary_tree_dfs.c @@ -0,0 +1,72 @@ +/** + * File: binary_tree_dfs.c + * Created Time: 2023-01-11 + * Author: Reanon (793584285@qq.com) + */ + +#include "../include/include.h" + +/* 辅助数组，用于存储遍历序列 */ +int *arr; + +/* 前序遍历 */ +void preOrder(TreeNode *root, int *size) { + + if (root == NULL) return; + // 访问优先级：根结点 -> 左子树 -> 右子树 + arr[(*size)++] = root->val; + preOrder(root->left, size); + preOrder(root->right, size); +} + +/* 中序遍历 */ +void inOrder(TreeNode *root, int *size) { + if (root == NULL) return; + // 访问优先级：左子树 -> 根结点 -> 右子树 + inOrder(root->left, size); + arr[(*size)++] = root->val; + inOrder(root->right, size); +} + +/* 后序遍历 */ +void postOrder(TreeNode *root, int *size) { + if (root == NULL) return; + // 访问优先级：左子树 -> 右子树 -> 根结点 + postOrder(root->left, size); + postOrder(root->right, size); + arr[(*size)++] = root->val; +} + + +/* Driver Code */ +int main() { + /* 初始化二叉树 */ + // 这里借助了一个从数组直接生成二叉树的函数 + int nums[] = {1, 2, 3, 4, 5, 6, 7}; + int size = sizeof(nums) / sizeof(int); + TreeNode *root = arrToTree(nums, size); + printf("初始化二叉树\n"); + printTree(root); + + /* 前序遍历 */ + // 初始化辅助数组 + arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE); + size = 0; + preOrder(root, &size); + printf("前序遍历的结点打印序列 = "); + printArray(arr, size); + + /* 中序遍历 */ + size = 0; + inOrder(root, &size); + printf("中序遍历的结点打印序列 = "); + printArray(arr, size); + + /* 后序遍历 */ + size = 0; + postOrder(root, &size); + printf("后序遍历的结点打印序列 = "); + printArray(arr, size); + + return 0; +} diff --git a/codes/c/include/CMakeLists.txt b/codes/c/include/CMakeLists.txt new file mode 100644 index 00000000..4189ae33 --- /dev/null +++ b/codes/c/include/CMakeLists.txt @@ -0,0 +1,4 @@ +add_executable(include + include_test.c + include.h print_util.h + list_node.h tree_node.h) \ No newline at end of file diff --git a/codes/c/include/PrintUtil.h b/codes/c/include/PrintUtil.h deleted file mode 100644 index 59a8eac1..00000000 --- a/codes/c/include/PrintUtil.h +++ /dev/null @@ -1,28 +0,0 @@ -/** - * File: PrintUtil.h - * Created Time: 2022-12-21 - * Author: MolDum (moldum@163.com) - */ - -#include -#include -#include - -// #include "ListNode.h" -// #include "TreeNode.h" - -/** - * @brief Print an Array - * - * @param arr - * @param n - */ - -static void printArray(int* arr, int n) -{ - printf("["); - for (int i = 0; i < n - 1; i++) { - printf("%d, ", arr[i]); - } - printf("%d]\n", arr[n-1]); -} diff --git a/codes/c/include/include.h b/codes/c/include/include.h index 2c4fd925..9f30b052 100644 --- a/codes/c/include/include.h +++ b/codes/c/include/include.h @@ -1,13 +1,28 @@ /** * File: include.h * Created Time: 2022-12-20 - * Author: MolDuM (moldum@163.com) + * Author: MolDuM (moldum@163.com)、Reanon (793584285@qq.com) */ +#ifndef C_INCLUDE_H +#define C_INCLUDE_H + #include #include #include #include #include -#include "PrintUtil.h" +#include "list_node.h" +#include "tree_node.h" +#include "print_util.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#ifdef __cplusplus +} +#endif + +#endif // C_INCLUDE_H diff --git a/codes/c/include/include_test.c b/codes/c/include/include_test.c new file mode 100644 index 00000000..602670d6 --- /dev/null +++ b/codes/c/include/include_test.c @@ -0,0 +1,38 @@ +/** + * File: include_test.c + * Created Time: 2023-01-10 + * Author: Reanon (793584285@qq.com) + */ + +#include "include.h" + +void testListNode() { + int nums[] = {2, 3, 5, 6, 7}; + int size = sizeof(nums) / sizeof(int); + ListNode *head = arrToLinkedList(nums, size); + printLinkedList(head); + + ListNode *node = getListNode(head, 5); + printf("find node: %d\n", node->val); +} + +void testTreeNode() { + int nums[] = {1, 2, 3, NIL, 5, 6, NIL}; + int size = sizeof(nums) / sizeof(int); + TreeNode *root = arrToTree(nums, size); + + // print tree + printTree(root); + + // tree to arr + int *arr = treeToArr(root); + printArray(arr, size); +} + +int main(int argc, char *argv[]) { + printf("==testListNode==\n"); + testListNode(); + printf("==testTreeNode==\n"); + testTreeNode(); + return 0; +} diff --git a/codes/c/include/list_node.h b/codes/c/include/list_node.h new file mode 100644 index 00000000..1845ffaf --- /dev/null +++ b/codes/c/include/list_node.h @@ -0,0 +1,72 @@ +/** + * File: list_node.h + * Created Time: 2023-01-09 + * Author: Reanon (793584285@qq.com) + */ +#ifndef LIST_NODE_H +#define LIST_NODE_H + +#ifdef __cplusplus +extern "C" { +#endif + +/** + * @brief Definition for a singly-linked list node + * + */ +struct ListNode { + int val; // 结点值 + struct ListNode *next; // 指向下一结点的指针（引用） +}; + +// typedef 为 C 语言的关键字，作用是为一种数据类型定义一个新名字 +typedef struct ListNode ListNode; + +ListNode *newListNode(int val) { + ListNode *node, *next; + node = (ListNode *) malloc(sizeof(ListNode)); + node->val = val; + node->next = NULL; + return node; +} + +/** + * @brief Generate a linked list with a vector + * + * @param list + * @return ListNode* + */ + +ListNode *arrToLinkedList(const int *arr, size_t size) { + if (size <= 0) { + return NULL; + } + + ListNode *dummy = newListNode(0); + ListNode *node = dummy; + for (int i = 0; i < size; i++) { + node->next = newListNode(arr[i]); + node = node->next; + } + return dummy->next; +} + +/** + * @brief Get a list node with specific value from a linked list + * + * @param head + * @param val + * @return ListNode* + */ +ListNode *getListNode(ListNode *head, int val) { + while (head != NULL && head->val != val) { + head = head->next; + } + return head; +} + +#ifdef __cplusplus +} +#endif + +#endif // LIST_NODE_H \ No newline at end of file diff --git a/codes/c/include/print_util.h b/codes/c/include/print_util.h new file mode 100644 index 00000000..a0c3a150 --- /dev/null +++ b/codes/c/include/print_util.h @@ -0,0 +1,135 @@ +/** + * File: print_util.h + * Created Time: 2022-12-21 + * Author: MolDum (moldum@163.com)、Reanon (793584285@qq.com) + */ + +#ifndef PRINT_UTIL_H +#define PRINT_UTIL_H + +#include +#include +#include + +#include "list_node.h" +#include "tree_node.h" + +#ifdef __cplusplus +extern "C" { +#endif + + +/** + * @brief Print an Array + * + * @param arr + * @param size + */ +static void printArray(int *arr, int size) { + printf("["); + for (int i = 0; i < size - 1; i++) { + if (arr[i] != NIL) { + printf("%d, ", arr[i]); + } else { + printf("NULL, "); + } + } + if (arr[size - 1] != NIL) { + printf("%d]\n", arr[size - 1]); + }else{ + printf("NULL]\n"); + } +} + +/** + * @brief Print a linked list + * + * @param head + */ +static void printLinkedList(ListNode *node) { + if (node == NULL) { + return; + } + while (node->next != NULL) { + printf("%d -> ", node->val); + node = node->next; + } + printf("%d\n", node->val); +} + +struct Trunk { + struct Trunk *prev; + char *str; +}; + +typedef struct Trunk Trunk; + +Trunk *newTrunk(Trunk *prev, char *str) { + Trunk *trunk = (Trunk *) malloc(sizeof(Trunk)); + trunk->prev = prev; + trunk->str = (char *) malloc(sizeof(char) * 10); + strcpy(trunk->str, str); + return trunk; +} + +/** + * @brief Helper function to print branches of the binary tree + * + * @param trunk + */ +void showTrunks(Trunk *trunk) { + if (trunk == NULL) { + return; + } + showTrunks(trunk->prev); + printf("%s", trunk->str); +} + +/** + * Help to print a binary tree, hide more details + * @param node + * @param prev + * @param isLeft + */ +static void printTreeHelper(TreeNode *node, Trunk *prev, bool isLeft) { + if (node == NULL) { + return; + } + char *prev_str = " "; + Trunk *trunk = newTrunk(prev, prev_str); + printTreeHelper(node->right, trunk, true); + if (prev == NULL) { + trunk->str = "———"; + } else if (isLeft) { + trunk->str = "/———"; + prev_str = " |"; + } else { + trunk->str = "\\———"; + prev->str = prev_str; + } + showTrunks(trunk); + printf("%d\n", node->val); + + if (prev != NULL) { + prev->str = prev_str; + } + trunk->str = " |"; + + printTreeHelper(node->left, trunk, false); +} + +/** + * @brief Print a binary tree + * + * @param head + */ +static void printTree(TreeNode *root) { + printTreeHelper(root, NULL, false); +} + + +#ifdef __cplusplus +} +#endif + +#endif // PRINT_UTIL_H diff --git a/codes/c/include/tree_node.h b/codes/c/include/tree_node.h new file mode 100644 index 00000000..c0438c43 --- /dev/null +++ b/codes/c/include/tree_node.h @@ -0,0 +1,131 @@ +/** + * File: tree_node.h + * Created Time: 2023-01-09 + * Author: Reanon (793584285@qq.com) + */ + + +#ifndef TREE_NODE_H +#define TREE_NODE_H + +#ifdef __cplusplus +extern "C" { +#endif + +#define NIL ('#') +#define MAX_NODE_SIZE 5000 + +struct TreeNode { + int val; + int height; + struct TreeNode *left; + struct TreeNode *right; +}; + +typedef struct TreeNode TreeNode; + + +TreeNode *newTreeNode(int val) { + TreeNode *node; + + node = (TreeNode *) malloc(sizeof(TreeNode)); + node->val = val; + node->height = 0; + node->left = NULL; + node->right = NULL; + return node; +} + +/** + * @brief Generate a binary tree with an array + * + * @param arr + * @param size + * @return TreeNode * + */ +TreeNode *arrToTree(const int *arr, size_t size) { + if (size <= 0) { + return NULL; + } + + int front, rear, index; + TreeNode *root, *node; + TreeNode **queue; + + /* 根结点 */ + root = newTreeNode(arr[0]); + /* 辅助队列 */ + queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE); + // 队列指针 + front = 0, rear = 0; + // 将根结点放入队尾 + queue[rear++] = root; + // 记录遍历数组的索引 + index = 0; + while (front < rear) { + // 取队列中的头结点，并让头结点出队 + node = queue[front++]; + index++; + if (index < size) { + if (arr[index] != NIL) { + node->left = newTreeNode(arr[index]); + queue[rear++] = node->left; + } + } + index++; + if (index < size) { + if (arr[index] != NIL) { + node->right = newTreeNode(arr[index]); + queue[rear++] = node->right; + } + } + } + return root; +} + + +/** + * @brief Generate a binary tree with an array + * + * @param arr + * @param size + * @return TreeNode * + */ +int *treeToArr(TreeNode *root) { + if (root == NULL) { + return NULL; + } + int front, rear; + int index, *arr; + TreeNode *node; + TreeNode **queue; + /* 辅助队列 */ + queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE); + // 队列指针 + front = 0, rear = 0; + // 将根结点放入队尾 + queue[rear++] = root; + /* 辅助数组 */ + arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE); + // 数组指针 + index = 0; + while (front < rear) { + // 取队列中的头结点，并让头结点出队 + node = queue[front++]; + if (node != NULL) { + arr[index] = node->val; + queue[rear++] = node->left; + queue[rear++] = node->right; + } else { + arr[index] = NIL; + } + index++; + } + return arr; +} + +#ifdef __cplusplus +} +#endif + +#endif // TREE_NODE_H diff --git a/codes/cpp/chapter_array_and_linkedlist/array.cpp b/codes/cpp/chapter_array_and_linkedlist/array.cpp index 6cf4919b..149a1ca2 100644 --- a/codes/cpp/chapter_array_and_linkedlist/array.cpp +++ b/codes/cpp/chapter_array_and_linkedlist/array.cpp @@ -23,6 +23,8 @@ int* extend(int* nums, int size, int enlarge) { for (int i = 0; i < size; i++) { res[i] = nums[i]; } + // 释放内存 + delete[] nums; // 返回扩展后的新数组 return res; } @@ -82,10 +84,7 @@ int main() { /* 长度扩展 */ int enlarge = 3; - int* res = extend(nums, size, enlarge); - int* temp = nums; - nums = res; - delete[] temp; + nums = extend(nums, size, enlarge); size += enlarge; cout << "将数组长度扩展至 8 ，得到 nums = "; PrintUtil::printArray(nums, size); @@ -107,5 +106,9 @@ int main() { int index = find(nums, size, 3); cout << "在 nums 中查找元素 3 ，得到索引 = " << index << endl; + // 释放内存 + delete[] arr; + delete[] nums; + return 0; } diff --git a/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp b/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp index 5e976a89..3e457891 100644 --- a/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp +++ b/codes/cpp/chapter_array_and_linkedlist/linked_list.cpp @@ -83,5 +83,8 @@ int main() { int index = find(n0, 2); cout << "链表中值为 2 的结点的索引 = " << index << endl; + // 释放内存 + freeMemoryLinkedList(n0); + return 0; } diff --git a/codes/cpp/chapter_array_and_linkedlist/my_list.cpp b/codes/cpp/chapter_array_and_linkedlist/my_list.cpp index 0b550475..7349e6f1 100644 --- a/codes/cpp/chapter_array_and_linkedlist/my_list.cpp +++ b/codes/cpp/chapter_array_and_linkedlist/my_list.cpp @@ -20,6 +20,11 @@ public: nums = new int[numsCapacity]; } + /* 析构函数 */ + ~MyList() { + delete[] nums; + } + /* 获取列表长度（即当前元素数量）*/ int size() { return numsSize; @@ -90,14 +95,14 @@ public: void extendCapacity() { // 新建一个长度为 size * extendRatio 的数组，并将原数组拷贝到新数组 int newCapacity = capacity() * extendRatio; - int* extend = new int[newCapacity]; + int* tmp = nums; + nums = new int[newCapacity]; // 将原数组中的所有元素复制到新数组 for (int i = 0; i < size(); i++) { - extend[i] = nums[i]; + nums[i] = tmp[i]; } - int* temp = nums; - nums = extend; - delete[] temp; + // 释放内存 + delete[] tmp; numsCapacity = newCapacity; } @@ -160,5 +165,8 @@ int main() { PrintUtil::printVector(vec); cout << "容量 = " << list->capacity() << " ，长度 = " << list->size() << endl; + // 释放内存 + delete list; + return 0; } diff --git a/codes/cpp/chapter_computational_complexity/leetcode_two_sum.cpp b/codes/cpp/chapter_computational_complexity/leetcode_two_sum.cpp index dd561d54..f68f242b 100644 --- a/codes/cpp/chapter_computational_complexity/leetcode_two_sum.cpp +++ b/codes/cpp/chapter_computational_complexity/leetcode_two_sum.cpp @@ -56,5 +56,9 @@ int main() { cout << "方法二 res = "; PrintUtil::printVector(res); + // 释放内存 + delete slt1; + delete slt2; + return 0; } diff --git a/codes/cpp/chapter_computational_complexity/space_complexity.cpp b/codes/cpp/chapter_computational_complexity/space_complexity.cpp index 6352b9d4..4a0e79ec 100644 --- a/codes/cpp/chapter_computational_complexity/space_complexity.cpp +++ b/codes/cpp/chapter_computational_complexity/space_complexity.cpp @@ -18,7 +18,7 @@ void constant(int n) { const int a = 0; int b = 0; vector nums(10000); - ListNode* node = new ListNode(0); + ListNode node(0); // 循环中的变量占用 O(1) 空间 for (int i = 0; i < n; i++) { int c = 0; @@ -34,9 +34,9 @@ void linear(int n) { // 长度为 n 的数组占用 O(n) 空间 vector nums(n); // 长度为 n 的列表占用 O(n) 空间 - vector nodes; + vector nodes; for (int i = 0; i < n; i++) { - nodes.push_back(new ListNode(i)); + nodes.push_back(ListNode(i)); } // 长度为 n 的哈希表占用 O(n) 空间 unordered_map map; @@ -98,5 +98,8 @@ int main() { TreeNode* root = buildTree(n); PrintUtil::printTree(root); + // 释放内存 + freeMemoryTree(root); + return 0; } diff --git a/codes/cpp/chapter_stack_and_queue/array_queue.cpp b/codes/cpp/chapter_stack_and_queue/array_queue.cpp index de5e780f..56b086e7 100644 --- a/codes/cpp/chapter_stack_and_queue/array_queue.cpp +++ b/codes/cpp/chapter_stack_and_queue/array_queue.cpp @@ -21,6 +21,10 @@ public: nums = new int[capacity]; } + ~ArrayQueue() { + delete[] nums; + } + /* 获取队列的容量 */ int capacity() { return cap; @@ -117,5 +121,8 @@ int main() { PrintUtil::printVector(queue->toVector()); } + // 释放内存 + delete queue; + return 0; } diff --git a/codes/cpp/chapter_stack_and_queue/array_stack.cpp b/codes/cpp/chapter_stack_and_queue/array_stack.cpp index e6159e8c..7f705d7e 100644 --- a/codes/cpp/chapter_stack_and_queue/array_stack.cpp +++ b/codes/cpp/chapter_stack_and_queue/array_stack.cpp @@ -78,5 +78,8 @@ int main() { bool empty = stack->empty(); cout << "栈是否为空 = " << empty << endl; + // 释放内存 + delete stack; + return 0; } diff --git a/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp b/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp index ae22740d..6c830ff8 100644 --- a/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp +++ b/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp @@ -19,6 +19,11 @@ public: queSize = 0; } + ~LinkedListQueue() { + delete front; + delete rear; + } + /* 获取队列的长度 */ int size() { return queSize; @@ -108,5 +113,8 @@ int main() { bool empty = queue->empty(); cout << "队列是否为空 = " << empty << endl; + // 释放内存 + delete queue; + return 0; } diff --git a/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp b/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp index 495f2660..7b25a9e4 100644 --- a/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp +++ b/codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp @@ -18,6 +18,10 @@ public: stkSize = 0; } + ~LinkedListStack() { + freeMemoryLinkedList(stackTop); + } + /* 获取栈的长度 */ int size() { return stkSize; @@ -97,5 +101,8 @@ int main() { bool empty = stack->empty(); cout << "栈是否为空 = " << empty << endl; + // 释放内存 + delete stack; + return 0; } diff --git a/codes/cpp/chapter_tree/binary_search_tree.cpp b/codes/cpp/chapter_tree/binary_search_tree.cpp index 006d7d30..fbbed9e9 100644 --- a/codes/cpp/chapter_tree/binary_search_tree.cpp +++ b/codes/cpp/chapter_tree/binary_search_tree.cpp @@ -17,6 +17,10 @@ public: root = buildTree(nums, 0, nums.size() - 1); // 构建二叉搜索树 } + ~BinarySearchTree() { + freeMemoryTree(root); + } + /* 获取二叉树根结点 */ TreeNode* getRoot() { return root; @@ -152,5 +156,8 @@ int main() { cout << endl << "删除结点 4 后，二叉树为\n" << endl; PrintUtil::printTree(bst->getRoot()); + // 释放内存 + delete bst; + return 0; } diff --git a/codes/cpp/chapter_tree/binary_tree.cpp b/codes/cpp/chapter_tree/binary_tree.cpp index cd06778a..f6a0a5d8 100644 --- a/codes/cpp/chapter_tree/binary_tree.cpp +++ b/codes/cpp/chapter_tree/binary_tree.cpp @@ -37,5 +37,8 @@ int main() { cout << endl << "删除结点 P 后\n" << endl; PrintUtil::printTree(n1); + // 释放内存 + freeMemoryTree(n1); + return 0; } diff --git a/codes/cpp/include/ListNode.hpp b/codes/cpp/include/ListNode.hpp index 9e6bd069..7b1eb413 100644 --- a/codes/cpp/include/ListNode.hpp +++ b/codes/cpp/include/ListNode.hpp @@ -48,3 +48,18 @@ ListNode* getListNode(ListNode *head, int val) { } return head; } + +/** + * @brief Free the memory allocated to a linked list + * + * @param cur + */ +void freeMemoryLinkedList(ListNode *cur) { + // 释放内存 + ListNode *pre; + while (cur != nullptr) { + pre = cur; + cur = cur->next; + delete pre; + } +} diff --git a/codes/cpp/include/TreeNode.hpp b/codes/cpp/include/TreeNode.hpp index 82f2ce98..505c4069 100644 --- a/codes/cpp/include/TreeNode.hpp +++ b/codes/cpp/include/TreeNode.hpp @@ -68,3 +68,16 @@ TreeNode *getTreeNode(TreeNode *root, int val) { TreeNode *right = getTreeNode(root->right, val); return left != nullptr ? left : right; } + +/** + * @brief Free the memory allocated to a tree + * + * @param root + */ +void freeMemoryTree(TreeNode *root) { + if (root == nullptr) return; + freeMemoryTree(root->left); + freeMemoryTree(root->right); + // 释放内存 + delete root; +} diff --git a/codes/cpp/include/include.hpp b/codes/cpp/include/include.hpp index 8e4a8070..03bf9b50 100644 --- a/codes/cpp/include/include.hpp +++ b/codes/cpp/include/include.hpp @@ -17,6 +17,8 @@ #include #include #include +#include +#include #include "ListNode.hpp" #include "TreeNode.hpp" diff --git a/codes/go/chapter_heap/heap.go b/codes/go/chapter_heap/heap.go new file mode 100644 index 00000000..5f846ced --- /dev/null +++ b/codes/go/chapter_heap/heap.go @@ -0,0 +1,45 @@ +// File: intHeap.go +// Created Time: 2023-01-12 +// Author: Reanon (793584285@qq.com) + +package chapter_heap + +// Go 语言中可以通过实现 heap.Interface 来构建整数大顶堆 +// 实现 heap.Interface 需要同时实现 sort.Interface +type intHeap []any + +// Push heap.Interface 的方法，实现推入元素到堆 +func (h *intHeap) Push(x any) { + // Push 和 Pop 使用 pointer receiver 作为参数 + // 因为它们不仅会对切片的内容进行调整，还会修改切片的长度。 + *h = append(*h, x.(int)) +} + +// Pop heap.Interface 的方法，实现弹出堆顶元素 +func (h *intHeap) Pop() any { + // 待出堆元素存放在最后 + last := (*h)[len(*h)-1] + *h = (*h)[:len(*h)-1] + return last +} + +// Len sort.Interface 的方法 +func (h *intHeap) Len() int { + return len(*h) +} + +// Less sort.Interface 的方法 +func (h *intHeap) Less(i, j int) bool { + // 如果实现小顶堆，则需要调整为小于号 + return (*h)[i].(int) > (*h)[j].(int) +} + +// Swap sort.Interface 的方法 +func (h *intHeap) Swap(i, j int) { + (*h)[i], (*h)[j] = (*h)[j], (*h)[i] +} + +// Top 获取堆顶元素 +func (h *intHeap) Top() any { + return (*h)[0] +} diff --git a/codes/go/chapter_heap/heap_test.go b/codes/go/chapter_heap/heap_test.go new file mode 100644 index 00000000..db3844ef --- /dev/null +++ b/codes/go/chapter_heap/heap_test.go @@ -0,0 +1,90 @@ +// File: heap_test.go +// Created Time: 2023-01-12 +// Author: Reanon (793584285@qq.com) + +package chapter_heap + +import ( + "container/heap" + "fmt" + "testing" + + . "github.com/krahets/hello-algo/pkg" +) + +func testPush(h *intHeap, val int) { + // 调用 heap.Interface 的方法，来添加元素 + heap.Push(h, val) + fmt.Printf("\n元素 %d 入堆后 \n", val) + PrintHeap(*h) +} + +func testPop(h *intHeap) { + // 调用 heap.Interface 的方法，来移除元素 + val := heap.Pop(h) + fmt.Printf("\n堆顶元素 %d 出堆后 \n", val) + PrintHeap(*h) +} + +func TestHeap(t *testing.T) { + /* 初始化堆 */ + // 初始化大顶堆 + maxHeap := &intHeap{} + heap.Init(maxHeap) + /* 元素入堆 */ + testPush(maxHeap, 1) + testPush(maxHeap, 3) + testPush(maxHeap, 2) + testPush(maxHeap, 5) + testPush(maxHeap, 4) + + /* 获取堆顶元素 */ + top := maxHeap.Top() + fmt.Printf("堆顶元素为 %d\n", top) + + /* 堆顶元素出堆 */ + testPop(maxHeap) + testPop(maxHeap) + testPop(maxHeap) + testPop(maxHeap) + testPop(maxHeap) + + /* 获取堆大小 */ + size := len(*maxHeap) + fmt.Printf("堆元素数量为 %d\n", size) + + /* 判断堆是否为空 */ + isEmpty := len(*maxHeap) == 0 + fmt.Printf("堆是否为空 %t\n", isEmpty) +} + +func TestMyHeap(t *testing.T) { + /* 初始化堆 */ + // 初始化大顶堆 + maxHeap := newMaxHeap([]any{9, 8, 6, 6, 7, 5, 2, 1, 4, 3, 6, 2}) + fmt.Printf("输入数组并建堆后\n") + maxHeap.print() + + /* 获取堆顶元素 */ + peek := maxHeap.peek() + fmt.Printf("\n堆顶元素为 %d\n", peek) + + /* 元素入堆 */ + val := 7 + maxHeap.push(val) + fmt.Printf("\n元素 %d 入堆后\n", val) + maxHeap.print() + + /* 堆顶元素出堆 */ + peek = maxHeap.poll() + fmt.Printf("\n堆顶元素 %d 出堆后\n", peek) + maxHeap.print() + + /* 获取堆大小 */ + size := maxHeap.size() + fmt.Printf("\n堆元素数量为 %d\n", size) + + /* 判断堆是否为空 */ + isEmpty := maxHeap.isEmpty() + fmt.Printf("\n堆是否为空 %t\n", isEmpty) +} diff --git a/codes/go/chapter_heap/my_heap.go b/codes/go/chapter_heap/my_heap.go new file mode 100644 index 00000000..0b3d0a3b --- /dev/null +++ b/codes/go/chapter_heap/my_heap.go @@ -0,0 +1,139 @@ +// File: my_heap.go +// Created Time: 2023-01-12 +// Author: Reanon (793584285@qq.com) + +package chapter_heap + +import ( + "fmt" + + . "github.com/krahets/hello-algo/pkg" +) + +type maxHeap struct { + // 使用切片而非数组，这样无需考虑扩容问题 + data []any +} + +/* 构造函数，建立空堆 */ +func newHeap() *maxHeap { + return &maxHeap{ + data: make([]any, 0), + } +} + +/* 构造函数，根据切片建堆 */ +func newMaxHeap(nums []any) *maxHeap { + // 所有元素入堆 + h := &maxHeap{data: nums} + for i := len(h.data) - 1; i >= 0; i-- { + // 堆化除叶结点以外的其他所有结点 + h.siftDown(i) + } + return h +} + +/* 获取左子结点索引 */ +func (h *maxHeap) left(i int) int { + return 2*i + 1 +} + +/* 获取右子结点索引 */ +func (h *maxHeap) right(i int) int { + return 2*i + 2 +} + +/* 获取父结点索引 */ +func (h *maxHeap) parent(i int) int { + // 向下整除 + return (i - 1) / 2 +} + +/* 交换元素 */ +func (h *maxHeap) swap(i, j int) { + h.data[i], h.data[j] = h.data[j], h.data[i] +} + +/* 获取堆大小 */ +func (h *maxHeap) size() int { + return len(h.data) +} + +/* 判断堆是否为空 */ +func (h *maxHeap) isEmpty() bool { + return len(h.data) == 0 +} + +/* 访问堆顶元素 */ +func (h *maxHeap) peek() any { + return h.data[0] +} + +/* 元素入堆 */ +func (h *maxHeap) push(val any) { + // 添加结点 + h.data = append(h.data, val) + // 从底至顶堆化 + h.siftUp(len(h.data) - 1) +} + +/* 从结点 i 开始，从底至顶堆化 */ +func (h *maxHeap) siftUp(i int) { + for true { + // 获取结点 i 的父结点 + p := h.parent(i) + // 当“越过根结点”或“结点无需修复”时，结束堆化 + if p < 0 || h.data[i].(int) <= h.data[p].(int) { + break + } + // 交换两结点 + h.swap(i, p) + // 循环向上堆化 + i = p + } +} + +/* 元素出堆 */ +func (h *maxHeap) poll() any { + // 判空处理 + if h.isEmpty() { + fmt.Println("error") + } + // 交换根结点与最右叶结点（即交换首元素与尾元素） + h.swap(0, h.size()-1) + // 删除结点 + val := h.data[len(h.data)-1] + h.data = h.data[:len(h.data)-1] + // 从顶至底堆化 + h.siftDown(0) + + // 返回堆顶元素 + return val +} + +/* 从结点 i 开始，从顶至底堆化 */ +func (h *maxHeap) siftDown(i int) { + for true { + // 判断结点 i, l, r 中值最大的结点，记为 max + l, r, max := h.left(i), h.right(i), i + if l < h.size() && h.data[l].(int) > h.data[max].(int) { + max = l + } + if r < h.size() && h.data[r].(int) > h.data[max].(int) { + max = r + } + // 若结点 i 最大或索引 l, r 越界，则无需继续堆化，跳出 + if max == i { + break + } + // 交换两结点 + h.swap(i, max) + // 循环向下堆化 + i = max + } +} + +/* 打印堆（二叉树） */ +func (h *maxHeap) print() { + PrintHeap(h.data) +} diff --git a/codes/go/chapter_tree/binary_search_tree_test.go b/codes/go/chapter_tree/binary_search_tree_test.go index 2109d5a4..2a864d13 100644 --- a/codes/go/chapter_tree/binary_search_tree_test.go +++ b/codes/go/chapter_tree/binary_search_tree_test.go @@ -20,7 +20,7 @@ func TestBinarySearchTree(t *testing.T) { fmt.Println("\n二叉树的根结点为:", node.Val) // 查找结点 - node = bst.Search(7) + node = bst.search(7) fmt.Println("查找到的结点对象为", node, "，结点值 =", node.Val) // 插入结点 diff --git a/codes/go/pkg/print_utils.go b/codes/go/pkg/print_utils.go index 575ab6b9..d65ebba1 100644 --- a/codes/go/pkg/print_utils.go +++ b/codes/go/pkg/print_utils.go @@ -29,6 +29,22 @@ func PrintList(list *list.List) { fmt.Print(e.Value, "]\n") } +// PrintMap Print a hash map +func PrintMap[K comparable, V any](m map[K]V) { + for key, value := range m { + fmt.Println(key, "->", value) + } +} + +// PrintHeap Print a heap +func PrintHeap(h []any) { + fmt.Printf("堆的数组表示：") + fmt.Printf("%v", h) + fmt.Printf("\n堆的树状表示：\n") + root := ArrToTree(h) + PrintTree(root) +} + // PrintLinkedList Print a linked list func PrintLinkedList(node *ListNode) { if node == nil { @@ -97,10 +113,3 @@ func showTrunk(t *trunk) { showTrunk(t.prev) fmt.Print(t.str) } - -// PrintMap Print a hash map -func PrintMap[K comparable, V any](m map[K]V) { - for key, value := range m { - fmt.Println(key, "->", value) - } -} diff --git a/codes/java/chapter_hashing/array_hash_map.java b/codes/java/chapter_hashing/array_hash_map.java index 68df1f3b..980a00ab 100644 --- a/codes/java/chapter_hashing/array_hash_map.java +++ b/codes/java/chapter_hashing/array_hash_map.java @@ -5,6 +5,7 @@ */ package chapter_hashing; + import java.util.*; /* 键值对 int->String */ diff --git a/codes/java/chapter_hashing/hash_map.java b/codes/java/chapter_hashing/hash_map.java index fe3f822f..47f4823b 100644 --- a/codes/java/chapter_hashing/hash_map.java +++ b/codes/java/chapter_hashing/hash_map.java @@ -5,6 +5,7 @@ */ package chapter_hashing; + import java.util.*; import include.*; diff --git a/codes/java/chapter_heap/heap.java b/codes/java/chapter_heap/heap.java new file mode 100644 index 00000000..1a0c53b9 --- /dev/null +++ b/codes/java/chapter_heap/heap.java @@ -0,0 +1,67 @@ +/** + * File: my_heap.java + * Created Time: 2023-01-07 + * Author: Krahets (krahets@163.com) + */ + +package chapter_heap; + +import include.*; +import java.util.*; + + +public class heap { + public static void testPush(Queue heap, int val) { + heap.add(val); // 元素入堆 + System.out.format("\n元素 %d 入堆后\n", val); + PrintUtil.printHeap(heap); + } + + public static void testPoll(Queue heap) { + int val = heap.poll(); // 堆顶元素出堆 + System.out.format("\n堆顶元素 %d 出堆后\n", val); + PrintUtil.printHeap(heap); + } + + public static void main(String[] args) { + /* 初始化堆 */ + // 初始化小顶堆 + Queue minHeap = new PriorityQueue<>(); + // 初始化大顶堆（使用 lambda 表达式修改 Comparator 即可） + Queue maxHeap = new PriorityQueue<>((a, b) -> { return b - a; }); + + System.out.println("\n以下测试样例为大顶堆"); + + /* 元素入堆 */ + testPush(maxHeap, 1); + testPush(maxHeap, 3); + testPush(maxHeap, 2); + testPush(maxHeap, 5); + testPush(maxHeap, 4); + + /* 获取堆顶元素 */ + int peek = maxHeap.peek(); + System.out.format("\n堆顶元素为 %d\n", peek); + + /* 堆顶元素出堆 */ + testPoll(maxHeap); + testPoll(maxHeap); + testPoll(maxHeap); + testPoll(maxHeap); + testPoll(maxHeap); + + /* 获取堆大小 */ + int size = maxHeap.size(); + System.out.format("\n堆元素数量为 %d\n", size); + + /* 判断堆是否为空 */ + boolean isEmpty = maxHeap.isEmpty(); + System.out.format("\n堆是否为空 %b\n", isEmpty); + + /* 输入列表并建堆 */ + // 时间复杂度为 O(n) ，而非 O(nlogn) + minHeap = new PriorityQueue<>(Arrays.asList(1, 3, 2, 5, 4)); + System.out.println("\n输入列表并建立小顶堆后"); + PrintUtil.printHeap(minHeap); + } +} diff --git a/codes/java/chapter_heap/my_heap.java b/codes/java/chapter_heap/my_heap.java new file mode 100644 index 00000000..b80ce6d0 --- /dev/null +++ b/codes/java/chapter_heap/my_heap.java @@ -0,0 +1,177 @@ +/** + * File: my_heap.java + * Created Time: 2023-01-07 + * Author: Krahets (krahets@163.com) + */ + +package chapter_heap; + +import include.*; +import java.util.*; + +class MaxHeap { + // 使用列表而非数组，这样无需考虑扩容问题 + private List maxHeap; + + /* 构造函数，建立空堆 */ + public MaxHeap() { + maxHeap = new ArrayList<>(); + } + + /* 构造函数，根据输入列表建堆 */ + public MaxHeap(List nums) { + // 所有元素入堆 + maxHeap = new ArrayList<>(nums); + // 堆化除叶结点以外的其他所有结点 + for (int i = parent(size() - 1); i >= 0; i--) { + siftDown(i); + } + } + + /* 获取左子结点索引 */ + private int left(int i) { + return 2 * i + 1; + } + + /* 获取右子结点索引 */ + private int right(int i) { + return 2 * i + 2; + } + + /* 获取父结点索引 */ + private int parent(int i) { + return (i - 1) / 2; // 向下整除 + } + + /* 交换元素 */ + private void swap(int i, int j) { + int a = maxHeap.get(i), + b = maxHeap.get(j), + tmp = a; + maxHeap.set(i, b); + maxHeap.set(j, tmp); + } + + /* 获取堆大小 */ + public int size() { + return maxHeap.size(); + } + + /* 判断堆是否为空 */ + public boolean isEmpty() { + return size() == 0; + } + + /* 访问堆顶元素 */ + public int peek() { + return maxHeap.get(0); + } + + /* 元素入堆 */ + public void push(int val) { + // 添加结点 + maxHeap.add(val); + // 从底至顶堆化 + siftUp(size() - 1); + } + + /* 从结点 i 开始，从底至顶堆化 */ + private void siftUp(int i) { + while (true) { + // 获取结点 i 的父结点 + int p = parent(i); + // 当“越过根结点”或“结点无需修复”时，结束堆化 + if (p < 0 || maxHeap.get(i) <= maxHeap.get(p)) + break; + // 交换两结点 + swap(i, p); + // 循环向上堆化 + i = p; + } + } + + /* 元素出堆 */ + public int poll() { + // 判空处理 + if (isEmpty()) + throw new EmptyStackException(); + // 交换根结点与最右叶结点（即交换首元素与尾元素） + swap(0, size() - 1); + // 删除结点 + int val = maxHeap.remove(size() - 1); + // 从顶至底堆化 + siftDown(0); + // 返回堆顶元素 + return val; + } + + /* 从结点 i 开始，从顶至底堆化 */ + private void siftDown(int i) { + while (true) { + // 判断结点 i, l, r 中值最大的结点，记为 ma + int l = left(i), r = right(i), ma = i; + if (l < size() && maxHeap.get(l) > maxHeap.get(ma)) + ma = l; + if (r < size() && maxHeap.get(r) > maxHeap.get(ma)) + ma = r; + // 若结点 i 最大或索引 l, r 越界，则无需继续堆化，跳出 + if (ma == i) break; + // 交换两结点 + swap(i, ma); + // 循环向下堆化 + i = ma; + } + } + + /* 打印堆（二叉树） */ + public void print() { + Queue queue = new PriorityQueue<>((a, b) -> { return b - a; }); + queue.addAll(maxHeap); + PrintUtil.printHeap(queue); + } +} + + +public class my_heap { + public static void testPush(MaxHeap maxHeap, int val) { + maxHeap.push(val); // 元素入堆 + System.out.format("\n添加元素 %d 后\n", val); + maxHeap.print(); + } + + public static void testPoll(MaxHeap maxHeap) { + int val = maxHeap.poll(); // 堆顶元素出堆 + System.out.format("\n出堆元素为 %d\n", val); + maxHeap.print(); + } + + public static void main(String[] args) { + /* 初始化大顶堆 */ + MaxHeap maxHeap = new MaxHeap(Arrays.asList(9, 8, 6, 6, 7, 5, 2, 1, 4, 3, 6, 2)); + System.out.println("\n输入列表并建堆后"); + maxHeap.print(); + + /* 获取堆顶元素 */ + int peek = maxHeap.peek(); + System.out.format("\n堆顶元素为 %d\n", peek); + + /* 元素入堆 */ + int val = 7; + maxHeap.push(val); + System.out.format("\n元素 %d 入堆后\n", val); + maxHeap.print(); + + /* 堆顶元素出堆 */ + peek = maxHeap.poll(); + System.out.format("\n堆顶元素 %d 出堆后\n", peek); + maxHeap.print(); + + /* 获取堆大小 */ + int size = maxHeap.size(); + System.out.format("\n堆元素数量为 %d\n", size); + + /* 判断堆是否为空 */ + boolean isEmpty = maxHeap.isEmpty(); + System.out.format("\n堆是否为空 %b\n", isEmpty); + } +} diff --git a/codes/java/chapter_tree/binary_tree_bfs.java b/codes/java/chapter_tree/binary_tree_bfs.java index 450311d0..ffeb352e 100644 --- a/codes/java/chapter_tree/binary_tree_bfs.java +++ b/codes/java/chapter_tree/binary_tree_bfs.java @@ -30,7 +30,7 @@ public class binary_tree_bfs { public static void main(String[] args) { /* 初始化二叉树 */ // 这里借助了一个从数组直接生成二叉树的函数 - TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 }); + TreeNode root = TreeNode.listToTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7)); System.out.println("\n初始化二叉树\n"); PrintUtil.printTree(root); diff --git a/codes/java/chapter_tree/binary_tree_dfs.java b/codes/java/chapter_tree/binary_tree_dfs.java index ad5337f2..9f2d0507 100644 --- a/codes/java/chapter_tree/binary_tree_dfs.java +++ b/codes/java/chapter_tree/binary_tree_dfs.java @@ -43,7 +43,7 @@ public class binary_tree_dfs { public static void main(String[] args) { /* 初始化二叉树 */ // 这里借助了一个从数组直接生成二叉树的函数 - TreeNode root = TreeNode.arrToTree(new Integer[] { 1, 2, 3, 4, 5, 6, 7 }); + TreeNode root = TreeNode.listToTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7)); System.out.println("\n初始化二叉树\n"); PrintUtil.printTree(root); diff --git a/codes/java/include/PrintUtil.java b/codes/java/include/PrintUtil.java index b2593ac1..1ebc45ba 100755 --- a/codes/java/include/PrintUtil.java +++ b/codes/java/include/PrintUtil.java @@ -105,10 +105,16 @@ public class PrintUtil { } } - public static void printHeap(PriorityQueue queue) { - Integer[] nums = (Integer[])queue.toArray(); - TreeNode root = TreeNode.arrToTree(nums); - + /** + * Print a heap (PriorityQueue) + * @param queue + */ + public static void printHeap(Queue queue) { + List list = new ArrayList<>(queue); + System.out.print("堆的数组表示："); + System.out.println(list); + System.out.println("堆的树状表示："); + TreeNode root = TreeNode.listToTree(list); printTree(root); } } diff --git a/codes/java/include/TreeNode.java b/codes/java/include/TreeNode.java index 11d457a1..22a34974 100644 --- a/codes/java/include/TreeNode.java +++ b/codes/java/include/TreeNode.java @@ -23,26 +23,27 @@ public class TreeNode { /** * Generate a binary tree given an array - * @param arr + * @param list * @return */ - public static TreeNode arrToTree(Integer[] arr) { - if (arr.length == 0) + public static TreeNode listToTree(List list) { + int size = list.size(); + if (size == 0) return null; - TreeNode root = new TreeNode(arr[0]); + TreeNode root = new TreeNode(list.get(0)); Queue queue = new LinkedList<>() {{ add(root); }}; int i = 0; while(!queue.isEmpty()) { TreeNode node = queue.poll(); - if (++i >= arr.length) break; - if(arr[i] != null) { - node.left = new TreeNode(arr[i]); + if (++i >= size) break; + if (list.get(i) != null) { + node.left = new TreeNode(list.get(i)); queue.add(node.left); } - if (++i >= arr.length) break; - if(arr[i] != null) { - node.right = new TreeNode(arr[i]); + if (++i >= size) break; + if (list.get(i) != null) { + node.right = new TreeNode(list.get(i)); queue.add(node.right); } } diff --git a/codes/javascript/chapter_searching/hashing_search.js b/codes/javascript/chapter_searching/hashing_search.js new file mode 100644 index 00000000..ebe6a139 --- /dev/null +++ b/codes/javascript/chapter_searching/hashing_search.js @@ -0,0 +1,51 @@ +/** + * File: hashing_search.js + * Created Time: 2022-12-29 + * Author: Zhuo Qinyue (1403450829@qq.com) + */ + +const PrintUtil = require("../include/PrintUtil"); +const ListNode = require("../include/ListNode"); + + +/* 哈希查找（数组） */ +function hashingSearch(map, target) { + // 哈希表的 key: 目标元素，value: 索引 + // 若哈希表中无此 key ，返回 -1 + return map.has(target) ? map.get(target) : -1; +} + +/* 哈希查找（链表） */ +function hashingSearch1(map, target) { + // 哈希表的 key: 目标结点值，value: 结点对象 + // 若哈希表中无此 key ，返回 null + return map.has(target) ? map.get(target) : null; +} + +function main() { + const target = 3; + + /* 哈希查找（数组） */ + const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]; + // 初始化哈希表 + const map = new Map(); + for (let i = 0; i < nums.length; i++) { + map.set(nums[i], i); // key: 元素，value: 索引 + } + const index = hashingSearch(map, target); + console.log("目标元素 3 的索引 = " + index); + + /* 哈希查找（链表） */ + let head = new ListNode().arrToLinkedList(nums) + // 初始化哈希表 + const map1 = new Map(); + while (head != null) { + map1.set(head.val, head); // key: 结点值，value: 结点 + head = head.next; + } + const node = hashingSearch1(map1, target); + console.log("目标结点值 3 的对应结点对象为" ); + PrintUtil.printLinkedList(node); +} + +main(); diff --git a/codes/javascript/chapter_sorting/bubble_sort.js b/codes/javascript/chapter_sorting/bubble_sort.js index 3d3c6a83..6ddb0a17 100644 --- a/codes/javascript/chapter_sorting/bubble_sort.js +++ b/codes/javascript/chapter_sorting/bubble_sort.js @@ -11,10 +11,10 @@ function bubbleSort(nums) { // 内循环：冒泡操作 for (let j = 0; j < i; j++) { if (nums[j] > nums[j + 1]) { - // 交换 nums[j] 与 nums[j + 1] - let tmp = nums[j]; - nums[j] = nums[j + 1]; - nums[j + 1] = tmp; + // 交换 nums[j] 与 nums[j + 1] + let tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; } } } @@ -40,10 +40,10 @@ function bubbleSortWithFlag(nums) { } /* Driver Code */ -var nums = [4, 1, 3, 1, 5, 2] -bubbleSort(nums) -console.log("排序后数组 nums =", nums) +const nums = [4, 1, 3, 1, 5, 2]; +bubbleSort(nums); +console.log("排序后数组 nums =", nums); -var nums1 = [4, 1, 3, 1, 5, 2] -bubbleSortWithFlag(nums1) -console.log("排序后数组 nums =", nums1) +const nums1 = [4, 1, 3, 1, 5, 2]; +bubbleSortWithFlag(nums1); +console.log("排序后数组 nums =", nums1); diff --git a/codes/javascript/chapter_sorting/insertion_sort.js b/codes/javascript/chapter_sorting/insertion_sort.js index 02c45a23..66264d23 100644 --- a/codes/javascript/chapter_sorting/insertion_sort.js +++ b/codes/javascript/chapter_sorting/insertion_sort.js @@ -19,6 +19,6 @@ function insertionSort(nums) { } /* Driver Code */ -var nums = [4, 1, 3, 1, 5, 2] -insertionSort(nums) -console.log("排序后数组 nums =", nums) +const nums = [4, 1, 3, 1, 5, 2]; +insertionSort(nums); +console.log('排序后数组 nums =', nums); diff --git a/codes/javascript/chapter_sorting/merge_sort.js b/codes/javascript/chapter_sorting/merge_sort.js index b00c17bc..4e2449af 100644 --- a/codes/javascript/chapter_sorting/merge_sort.js +++ b/codes/javascript/chapter_sorting/merge_sort.js @@ -5,10 +5,10 @@ */ /** -* 合并左子数组和右子数组 -* 左子数组区间 [left, mid] -* 右子数组区间 [mid + 1, right] -*/ + * 合并左子数组和右子数组 + * 左子数组区间 [left, mid] + * 右子数组区间 [mid + 1, right] + */ function merge(nums, left, mid, right) { // 初始化辅助数组 let tmp = nums.slice(left, right + 1); @@ -46,6 +46,6 @@ function mergeSort(nums, left, right) { } /* Driver Code */ -var nums = [ 7, 3, 2, 6, 0, 1, 5, 4 ] +const nums = [ 7, 3, 2, 6, 0, 1, 5, 4 ] mergeSort(nums, 0, nums.length - 1) -console.log("归并排序完成后 nums =", nums) +console.log('归并排序完成后 nums =', nums) diff --git a/codes/javascript/chapter_sorting/quick_sort.js b/codes/javascript/chapter_sorting/quick_sort.js index 405bf762..47ac100f 100644 --- a/codes/javascript/chapter_sorting/quick_sort.js +++ b/codes/javascript/chapter_sorting/quick_sort.js @@ -8,38 +8,38 @@ class QuickSort { /* 元素交换 */ swap(nums, i, j) { - let tmp = nums[i] - nums[i] = nums[j] - nums[j] = tmp + let tmp = nums[i]; + nums[i] = nums[j]; + nums[j] = tmp; } /* 哨兵划分 */ - partition(nums, left, right){ + partition(nums, left, right) { // 以 nums[left] 作为基准数 - let i = left, j = right - while(i < j){ - while(i < j && nums[j] >= nums[left]){ - j -= 1 // 从右向左找首个小于基准数的元素 + let i = left, j = right; + while (i < j) { + while (i < j && nums[j] >= nums[left]) { + j -= 1; // 从右向左找首个小于基准数的元素 } - while(i < j && nums[i] <= nums[left]){ - i += 1 // 从左向右找首个大于基准数的元素 + while (i < j && nums[i] <= nums[left]) { + i += 1; // 从左向右找首个大于基准数的元素 } // 元素交换 - this.swap(nums, i, j) // 交换这两个元素 + this.swap(nums, i, j); // 交换这两个元素 } - this.swap(nums, i, left) // 将基准数交换至两子数组的分界线 - return i // 返回基准数的索引 + this.swap(nums, i, left); // 将基准数交换至两子数组的分界线 + return i; // 返回基准数的索引 } /* 快速排序 */ - quickSort(nums, left, right){ + quickSort(nums, left, right) { // 子数组长度为 1 时终止递归 - if(left >= right) return + if (left >= right) return; // 哨兵划分 - const pivot = this.partition(nums, left, right) + const pivot = this.partition(nums, left, right); // 递归左子数组、右子数组 - this.quickSort(nums, left, pivot - 1) - this.quickSort(nums, pivot + 1, right) + this.quickSort(nums, left, pivot - 1); + this.quickSort(nums, pivot + 1, right); } } @@ -47,21 +47,18 @@ class QuickSort { class QuickSortMedian { /* 元素交换 */ swap(nums, i, j) { - let tmp = nums[i] - nums[i] = nums[j] - nums[j] = tmp + let tmp = nums[i]; + nums[i] = nums[j]; + nums[j] = tmp; } /* 选取三个元素的中位数 */ medianThree(nums, left, mid, right) { // 使用了异或操作来简化代码 // 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1 - if ((nums[left] > nums[mid]) ^ (nums[left] > nums[right])) - return left; - else if ((nums[mid] < nums[left]) ^ (nums[mid] < nums[right])) - return mid; - else - return right; + if ((nums[left] > nums[mid]) ^ (nums[left] > nums[right])) return left; + else if ((nums[mid] < nums[left]) ^ (nums[mid] < nums[right])) return mid; + else return right; } /* 哨兵划分（三数取中值） */ @@ -73,14 +70,12 @@ class QuickSortMedian { // 以 nums[left] 作为基准数 let i = left, j = right; while (i < j) { - while (i < j && nums[j] >= nums[left]) - j--; // 从右向左找首个小于基准数的元素 - while (i < j && nums[i] <= nums[left]) - i++; // 从左向右找首个大于基准数的元素 + while (i < j && nums[j] >= nums[left]) j--; // 从右向左找首个小于基准数的元素 + while (i < j && nums[i] <= nums[left]) i++; // 从左向右找首个大于基准数的元素 this.swap(nums, i, j); // 交换这两个元素 } - this.swap(nums, i, left); // 将基准数交换至两子数组的分界线 - return i; // 返回基准数的索引 + this.swap(nums, i, left); // 将基准数交换至两子数组的分界线 + return i; // 返回基准数的索引 } /* 快速排序 */ @@ -99,9 +94,9 @@ class QuickSortMedian { class QuickSortTailCall { /* 元素交换 */ swap(nums, i, j) { - let tmp = nums[i] - nums[i] = nums[j] - nums[j] = tmp + let tmp = nums[i]; + nums[i] = nums[j]; + nums[j] = tmp; } /* 哨兵划分 */ @@ -109,13 +104,11 @@ class QuickSortTailCall { // 以 nums[left] 作为基准数 let i = left, j = right; while (i < j) { - while (i < j && nums[j] >= nums[left]) - j--; // 从右向左找首个小于基准数的元素 - while (i < j && nums[i] <= nums[left]) - i++; // 从左向右找首个大于基准数的元素 + while (i < j && nums[j] >= nums[left]) j--; // 从右向左找首个小于基准数的元素 + while (i < j && nums[i] <= nums[left]) i++; // 从左向右找首个大于基准数的元素 this.swap(nums, i, j); // 交换这两个元素 } - this.swap(nums, i, left); // 将基准数交换至两子数组的分界线 + this.swap(nums, i, left); // 将基准数交换至两子数组的分界线 return i; // 返回基准数的索引 } @@ -127,8 +120,8 @@ class QuickSortTailCall { let pivot = this.partition(nums, left, right); // 对两个子数组中较短的那个执行快排 if (pivot - left < right - pivot) { - this.quickSort(nums, left, pivot - 1); // 递归排序左子数组 - left = pivot + 1; // 剩余待排序区间为 [pivot + 1, right] + this.quickSort(nums, left, pivot - 1); // 递归排序左子数组 + left = pivot + 1; // 剩余待排序区间为 [pivot + 1, right] } else { this.quickSort(nums, pivot + 1, right); // 递归排序右子数组 right = pivot - 1; // 剩余待排序区间为 [left, pivot - 1] @@ -139,19 +132,19 @@ class QuickSortTailCall { /* Driver Code */ /* 快速排序 */ -var nums = [4, 1, 3, 1, 5, 2] -var quickSort = new QuickSort() -quickSort.quickSort(nums, 0, nums.length - 1) -console.log("快速排序完成后 nums =", nums) +const nums = [4, 1, 3, 1, 5, 2]; +const quickSort = new QuickSort(); +quickSort.quickSort(nums, 0, nums.length - 1); +console.log('快速排序完成后 nums =', nums); /* 快速排序（中位基准数优化） */ -nums1 = [4, 1, 3, 1, 5,2] -var quickSortMedian = new QuickSort() -quickSortMedian.quickSort(nums1, 0, nums1.length - 1) -console.log("快速排序（中位基准数优化）完成后 nums =", nums1) +const nums1 = [4, 1, 3, 1, 5, 2]; +const quickSortMedian = new QuickSort(); +quickSortMedian.quickSort(nums1, 0, nums1.length - 1); +console.log('快速排序（中位基准数优化）完成后 nums =', nums1); /* 快速排序（尾递归优化） */ -nums2 = [4, 1, 3, 1, 5, 2] -var quickSortTailCall = new QuickSort() -quickSortTailCall.quickSort(nums2, 0, nums2.length - 1) -console.log("快速排序（尾递归优化）完成后 nums =", nums2) +const nums2 = [4, 1, 3, 1, 5, 2]; +const quickSortTailCall = new QuickSort(); +quickSortTailCall.quickSort(nums2, 0, nums2.length - 1); +console.log('快速排序（尾递归优化）完成后 nums =', nums2); diff --git a/codes/swift/Package.swift b/codes/swift/Package.swift index 3a5a18ed..c20c58f9 100644 --- a/codes/swift/Package.swift +++ b/codes/swift/Package.swift @@ -13,6 +13,13 @@ let package = Package( .executable(name: "linked_list", targets: ["linked_list"]), .executable(name: "list", targets: ["list"]), .executable(name: "my_list", targets: ["my_list"]), + .executable(name: "stack", targets: ["stack"]), + .executable(name: "linkedlist_stack", targets: ["linkedlist_stack"]), + .executable(name: "array_stack", targets: ["array_stack"]), + .executable(name: "queue", targets: ["queue"]), + .executable(name: "linkedlist_queue", targets: ["linkedlist_queue"]), + .executable(name: "array_queue", targets: ["array_queue"]), + .executable(name: "deque", targets: ["deque"]), ], targets: [ .target(name: "utils", path: "utils"), @@ -24,5 +31,12 @@ let package = Package( .executableTarget(name: "linked_list", dependencies: ["utils"], path: "chapter_array_and_linkedlist", sources: ["linked_list.swift"]), .executableTarget(name: "list", path: "chapter_array_and_linkedlist", sources: ["list.swift"]), .executableTarget(name: "my_list", path: "chapter_array_and_linkedlist", sources: ["my_list.swift"]), + .executableTarget(name: "stack", path: "chapter_stack_and_queue", sources: ["stack.swift"]), + .executableTarget(name: "linkedlist_stack", dependencies: ["utils"], path: "chapter_stack_and_queue", sources: ["linkedlist_stack.swift"]), + .executableTarget(name: "array_stack", path: "chapter_stack_and_queue", sources: ["array_stack.swift"]), + .executableTarget(name: "queue", path: "chapter_stack_and_queue", sources: ["queue.swift"]), + .executableTarget(name: "linkedlist_queue", dependencies: ["utils"], path: "chapter_stack_and_queue", sources: ["linkedlist_queue.swift"]), + .executableTarget(name: "array_queue", path: "chapter_stack_and_queue", sources: ["array_queue.swift"]), + .executableTarget(name: "deque", path: "chapter_stack_and_queue", sources: ["deque.swift"]), ] ) diff --git a/codes/swift/chapter_stack_and_queue/array_queue.swift b/codes/swift/chapter_stack_and_queue/array_queue.swift new file mode 100644 index 00000000..d76dbc9c --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/array_queue.swift @@ -0,0 +1,116 @@ +/** + * File: array_queue.swift + * Created Time: 2023-01-11 + * Author: nuomi1 (nuomi1@qq.com) + */ + +/* 基于环形数组实现的队列 */ +class ArrayQueue { + private var nums: [Int] // 用于存储队列元素的数组 + private var front = 0 // 头指针，指向队首 + private var rear = 0 // 尾指针，指向队尾 + 1 + + init(capacity: Int) { + // 初始化数组 + nums = Array(repeating: 0, count: capacity) + } + + /* 获取队列的容量 */ + func capacity() -> Int { + nums.count + } + + /* 获取队列的长度 */ + func size() -> Int { + let capacity = capacity() + // 由于将数组看作为环形，可能 rear < front ，因此需要取余数 + return (capacity + rear - front) % capacity + } + + /* 判断队列是否为空 */ + func isEmpty() -> Bool { + rear - front == 0 + } + + /* 入队 */ + func offer(num: Int) { + if size() == capacity() { + print("队列已满") + return + } + // 尾结点后添加 num + nums[rear] = num + // 尾指针向后移动一位，越过尾部后返回到数组头部 + rear = (rear + 1) % capacity() + } + + /* 出队 */ + @discardableResult + func poll() -> Int { + let num = peek() + // 队头指针向后移动一位，若越过尾部则返回到数组头部 + front = (front + 1) % capacity() + return num + } + + /* 访问队首元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("队列为空") + } + return nums[front] + } + + /* 返回数组 */ + func toArray() -> [Int] { + let size = size() + let capacity = capacity() + // 仅转换有效长度范围内的列表元素 + var res = Array(repeating: 0, count: size) + for (i, j) in sequence(first: (0, front), next: { $0 < size - 1 ? ($0 + 1, $1 + 1) : nil }) { + res[i] = nums[j % capacity] + } + return res + } +} + +@main +enum _ArrayQueue { + /* Driver Code */ + static func main() { + /* 初始化队列 */ + let capacity = 10 + let queue = ArrayQueue(capacity: capacity) + + /* 元素入队 */ + queue.offer(num: 1) + queue.offer(num: 3) + queue.offer(num: 2) + queue.offer(num: 5) + queue.offer(num: 4) + print("队列 queue = \(queue.toArray())") + + /* 访问队首元素 */ + let peek = queue.peek() + print("队首元素 peek = \(peek)") + + /* 元素出队 */ + let poll = queue.poll() + print("出队元素 poll = \(poll)，出队后 queue = \(queue.toArray())") + + /* 获取队列的长度 */ + let size = queue.size() + print("队列长度 size = \(size)") + + /* 判断队列是否为空 */ + let isEmpty = queue.isEmpty() + print("队列是否为空 = \(isEmpty)") + + /* 测试环形数组 */ + for i in 0 ..< 10 { + queue.offer(num: i) + queue.poll() + print("第 \(i) 轮入队 + 出队后 queue = \(queue.toArray())") + } + } +} diff --git a/codes/swift/chapter_stack_and_queue/array_stack.swift b/codes/swift/chapter_stack_and_queue/array_stack.swift new file mode 100644 index 00000000..144ebec9 --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/array_stack.swift @@ -0,0 +1,85 @@ +/** + * File: array_stack.swift + * Created Time: 2023-01-09 + * Author: nuomi1 (nuomi1@qq.com) + */ + +/* 基于数组实现的栈 */ +class ArrayStack { + private var stack: [Int] + + init() { + // 初始化列表（动态数组） + stack = [] + } + + /* 获取栈的长度 */ + func size() -> Int { + stack.count + } + + /* 判断栈是否为空 */ + func isEmpty() -> Bool { + stack.isEmpty + } + + /* 入栈 */ + func push(num: Int) { + stack.append(num) + } + + /* 出栈 */ + @discardableResult + func pop() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return stack.removeLast() + } + + /* 访问栈顶元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return stack.last! + } + + /* 将 List 转化为 Array 并返回 */ + func toArray() -> [Int] { + stack + } +} + +@main +enum _ArrayStack { + /* Driver Code */ + static func main() { + /* 初始化栈 */ + let stack = ArrayStack() + + /* 元素入栈 */ + stack.push(num: 1) + stack.push(num: 3) + stack.push(num: 2) + stack.push(num: 5) + stack.push(num: 4) + print("栈 stack = \(stack.toArray())") + + /* 访问栈顶元素 */ + let peek = stack.peek() + print("栈顶元素 peek = \(peek)") + + /* 元素出栈 */ + let pop = stack.pop() + print("出栈元素 pop = \(pop)，出栈后 stack = \(stack.toArray())") + + /* 获取栈的长度 */ + let size = stack.size() + print("栈的长度 size = \(size)") + + /* 判断是否为空 */ + let isEmpty = stack.isEmpty() + print("栈是否为空 = \(isEmpty)") + } +} diff --git a/codes/swift/chapter_stack_and_queue/deque.swift b/codes/swift/chapter_stack_and_queue/deque.swift new file mode 100644 index 00000000..6638eacb --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/deque.swift @@ -0,0 +1,44 @@ +/** + * File: deque.swift + * Created Time: 2023-01-14 + * Author: nuomi1 (nuomi1@qq.com) + */ + +@main +enum Deque { + /* Driver Code */ + static func main() { + /* 初始化双向队列 */ + // Swift 没有内置的双向队列类，可以把 Array 当作双向队列来使用 + var deque: [Int] = [] + + /* 元素入队 */ + deque.append(2) + deque.append(5) + deque.append(4) + deque.insert(3, at: 0) + deque.insert(1, at: 0) + print("双向队列 deque = \(deque)") + + /* 访问元素 */ + let peekFirst = deque.first! + print("队首元素 peekFirst = \(peekFirst)") + let peekLast = deque.last! + print("队尾元素 peekLast = \(peekLast)") + + /* 元素出队 */ + // 使用 Array 模拟时 pollFirst 的复杂度为 O(n) + let pollFirst = deque.removeFirst() + print("队首出队元素 pollFirst = \(pollFirst)，队首出队后 deque = \(deque)") + let pollLast = deque.removeLast() + print("队尾出队元素 pollLast = \(pollLast)，队尾出队后 deque = \(deque)") + + /* 获取双向队列的长度 */ + let size = deque.count + print("双向队列长度 size = \(size)") + + /* 判断双向队列是否为空 */ + let isEmpty = deque.isEmpty + print("双向队列是否为空 = \(isEmpty)") + } +} diff --git a/codes/swift/chapter_stack_and_queue/linkedlist_queue.swift b/codes/swift/chapter_stack_and_queue/linkedlist_queue.swift new file mode 100644 index 00000000..1d671742 --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/linkedlist_queue.swift @@ -0,0 +1,105 @@ +/** + * File: linkedlist_queue.swift + * Created Time: 2023-01-11 + * Author: nuomi1 (nuomi1@qq.com) + */ + +import utils + +/* 基于链表实现的队列 */ +class LinkedListQueue { + private var front: ListNode? // 头结点 + private var rear: ListNode? // 尾结点 + private var _size = 0 + + init() {} + + /* 获取队列的长度 */ + func size() -> Int { + _size + } + + /* 判断队列是否为空 */ + func isEmpty() -> Bool { + size() == 0 + } + + /* 入队 */ + func offer(num: Int) { + // 尾结点后添加 num + let node = ListNode(x: num) + // 如果队列为空，则令头、尾结点都指向该结点 + if front == nil { + front = node + rear = node + } + // 如果队列不为空，则将该结点添加到尾结点后 + else { + rear?.next = node + rear = node + } + _size += 1 + } + + /* 出队 */ + @discardableResult + func poll() -> Int { + let num = peek() + // 删除头结点 + front = front?.next + _size -= 1 + return num + } + + /* 访问队首元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("队列为空") + } + return front!.val + } + + /* 将链表转化为 Array 并返回 */ + func toArray() -> [Int] { + var node = front + var res = Array(repeating: 0, count: size()) + for i in res.indices { + res[i] = node!.val + node = node?.next + } + return res + } +} + +@main +enum _LinkedListQueue { + /* Driver Code */ + static func main() { + /* 初始化队列 */ + let queue = LinkedListQueue() + + /* 元素入队 */ + queue.offer(num: 1) + queue.offer(num: 3) + queue.offer(num: 2) + queue.offer(num: 5) + queue.offer(num: 4) + print("队列 queue = \(queue.toArray())") + + /* 访问队首元素 */ + let peek = queue.peek() + print("队首元素 peek = \(peek)") + + /* 元素出队 */ + let poll = queue.poll() + print("出队元素 poll = \(poll)，出队后 queue = \(queue.toArray())") + + /* 获取队列的长度 */ + let size = queue.size() + print("队列长度 size = \(size)") + + /* 判断队列是否为空 */ + let isEmpty = queue.isEmpty() + print("队列是否为空 = \(isEmpty)") + } +} diff --git a/codes/swift/chapter_stack_and_queue/linkedlist_stack.swift b/codes/swift/chapter_stack_and_queue/linkedlist_stack.swift new file mode 100644 index 00000000..97f7dabc --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/linkedlist_stack.swift @@ -0,0 +1,94 @@ +/** + * File: linkedlist_stack.swift + * Created Time: 2023-01-09 + * Author: nuomi1 (nuomi1@qq.com) + */ + +import utils + +/* 基于链表实现的栈 */ +class LinkedListStack { + private var _peek: ListNode? // 将头结点作为栈顶 + private var _size = 0 // 栈的长度 + + init() {} + + /* 获取栈的长度 */ + func size() -> Int { + _size + } + + /* 判断栈是否为空 */ + func isEmpty() -> Bool { + size() == 0 + } + + /* 入栈 */ + func push(num: Int) { + let node = ListNode(x: num) + node.next = _peek + _peek = node + _size += 1 + } + + /* 出栈 */ + @discardableResult + func pop() -> Int { + let num = peek() + _peek = _peek?.next + _size -= 1 + return num + } + + /* 访问栈顶元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return _peek!.val + } + + /* 将 List 转化为 Array 并返回 */ + func toArray() -> [Int] { + var node = _peek + var res = Array(repeating: 0, count: _size) + for i in sequence(first: res.count - 1, next: { $0 >= 0 + 1 ? $0 - 1 : nil }) { + res[i] = node!.val + node = node?.next + } + return res + } +} + +@main +enum _LinkedListStack { + /* Driver Code */ + static func main() { + /* 初始化栈 */ + let stack = LinkedListStack() + + /* 元素入栈 */ + stack.push(num: 1) + stack.push(num: 3) + stack.push(num: 2) + stack.push(num: 5) + stack.push(num: 4) + print("栈 stack = \(stack.toArray())") + + /* 访问栈顶元素 */ + let peek = stack.peek() + print("栈顶元素 peek = \(peek)") + + /* 元素出栈 */ + let pop = stack.pop() + print("出栈元素 pop = \(pop)，出栈后 stack = \(stack.toArray())") + + /* 获取栈的长度 */ + let size = stack.size() + print("栈的长度 size = \(size)") + + /* 判断是否为空 */ + let isEmpty = stack.isEmpty() + print("栈是否为空 = \(isEmpty)") + } +} diff --git a/codes/swift/chapter_stack_and_queue/queue.swift b/codes/swift/chapter_stack_and_queue/queue.swift new file mode 100644 index 00000000..ea1e9472 --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/queue.swift @@ -0,0 +1,40 @@ +/** + * File: queue.swift + * Created Time: 2023-01-11 + * Author: nuomi1 (nuomi1@qq.com) + */ + +@main +enum Queue { + /* Driver Code */ + static func main() { + /* 初始化队列 */ + // Swift 没有内置的队列类，可以把 Array 当作队列来使用 + var queue: [Int] = [] + + /* 元素入队 */ + queue.append(1) + queue.append(3) + queue.append(2) + queue.append(5) + queue.append(4) + print("队列 queue = \(queue)") + + /* 访问队首元素 */ + let peek = queue.first! + print("队首元素 peek = \(peek)") + + /* 元素出队 */ + // 使用 Array 模拟时 poll 的复杂度为 O(n) + let pool = queue.removeFirst() + print("出队元素 poll = \(pool)，出队后 queue = \(queue)") + + /* 获取队列的长度 */ + let size = queue.count + print("队列长度 size = \(size)") + + /* 判断队列是否为空 */ + let isEmpty = queue.isEmpty + print("队列是否为空 = \(isEmpty)") + } +} diff --git a/codes/swift/chapter_stack_and_queue/stack.swift b/codes/swift/chapter_stack_and_queue/stack.swift new file mode 100644 index 00000000..c6b8bc18 --- /dev/null +++ b/codes/swift/chapter_stack_and_queue/stack.swift @@ -0,0 +1,39 @@ +/** + * File: stack.swift + * Created Time: 2023-01-09 + * Author: nuomi1 (nuomi1@qq.com) + */ + +@main +enum Stack { + /* Driver Code */ + static func main() { + /* 初始化栈 */ + // Swift 没有内置的栈类，可以把 Array 当作栈来使用 + var stack: [Int] = [] + + /* 元素入栈 */ + stack.append(1) + stack.append(3) + stack.append(2) + stack.append(5) + stack.append(4) + print("栈 stack = \(stack)") + + /* 访问栈顶元素 */ + let peek = stack.last! + print("栈顶元素 peek = \(peek)") + + /* 元素出栈 */ + let pop = stack.removeLast() + print("出栈元素 pop = \(pop)，出栈后 stack = \(stack)") + + /* 获取栈的长度 */ + let size = stack.count + print("栈的长度 size = \(size)") + + /* 判断是否为空 */ + let isEmpty = stack.isEmpty + print("栈是否为空 = \(isEmpty)") + } +} diff --git a/codes/typescript/chapter_searching/hashing_search.ts b/codes/typescript/chapter_searching/hashing_search.ts new file mode 100644 index 00000000..7f93d717 --- /dev/null +++ b/codes/typescript/chapter_searching/hashing_search.ts @@ -0,0 +1,51 @@ +/** + * File: hashing_search.js + * Created Time: 2022-12-29 + * Author: Zhuo Qinyue (1403450829@qq.com) + */ + +import { printLinkedList } from "../module/PrintUtil"; +import ListNode from "../module/ListNode"; + + +/* 哈希查找（数组） */ +function hashingSearch(map: Map, target: number): number { + // 哈希表的 key: 目标元素，value: 索引 + // 若哈希表中无此 key ，返回 -1 + return map.has(target) ? map.get(target) as number : -1; +} + +/* 哈希查找（链表） */ +function hashingSearch1(map: Map, target: number): ListNode | null { + // 哈希表的 key: 目标结点值，value: 结点对象 + // 若哈希表中无此 key ，返回 null + return map.has(target) ? map.get(target) as ListNode : null; +} + +function main() { + const target = 3; + + /* 哈希查找（数组） */ + const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]; + // 初始化哈希表 + const map = new Map(); + for (let i = 0; i < nums.length; i++) { + map.set(nums[i], i); // key: 元素，value: 索引 + } + const index = hashingSearch(map, target); + console.log("目标元素 3 的索引 = " + index); + + /* 哈希查找（链表） */ + let head = new ListNode().arrToLinkedList(nums) + // 初始化哈希表 + const map1 = new Map(); + while (head != null) { + map1.set(head.val, head); // key: 结点值，value: 结点 + head = head.next; + } + const node = hashingSearch1(map1, target); + console.log("目标结点值 3 的对应结点对象为"); + printLinkedList(node); +} + +main(); diff --git a/codes/typescript/chapter_searching/linear_search.ts b/codes/typescript/chapter_searching/linear_search.ts new file mode 100644 index 00000000..f0de33f7 --- /dev/null +++ b/codes/typescript/chapter_searching/linear_search.ts @@ -0,0 +1,47 @@ +/** + * File: linear_search.ts + * Created Time: 2023-01-07 + * Author: Daniel (better.sunjian@gmail.com) + */ + +import ListNode from '../module/ListNode.ts'; + +/* 线性查找（数组）*/ +function linearSearchArray(nums: number[], target: number): number { + // 遍历数组 + for (let i = 0; i < nums.length; i++) { + // 找到目标元素，返回其索引 + if (nums[i] === target) { + return i; + } + } + // 未找到目标元素，返回 -1 + return -1; +} + +/* 线性查找（链表）*/ +function linearSearchLinkedList(head: ListNode | null, target: number): ListNode | null { + // 遍历链表 + while (head) { + // 找到目标结点，返回之 + if (head.val === target) { + return head; + } + head = head.next; + } + // 未找到目标结点，返回 null + return null; +} + +/* Driver Code */ +const target = 3; + +/* 在数组中执行线性查找 */ +const nums = [ 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 ]; +const index = linearSearchArray(nums, target); +console.log('目标元素 3 的索引 =', index); + +/* 在链表中执行线性查找 */ +const head = ListNode.arrToLinkedList(nums); +const node = linearSearchLinkedList(head, target); +console.log('目标结点值 3 的对应结点对象为', node); diff --git a/codes/typescript/chapter_sorting/merge_sort.ts b/codes/typescript/chapter_sorting/merge_sort.ts index a4cb5e1c..75450294 100644 --- a/codes/typescript/chapter_sorting/merge_sort.ts +++ b/codes/typescript/chapter_sorting/merge_sort.ts @@ -23,10 +23,10 @@ function merge(nums: number[], left: number, mid: number, right: number): void { // 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++ if (i > leftEnd) { nums[k] = tmp[j++]; - // 否则，若“右子数组已全部合并完”或“左子数组元素 <= 右子数组元素”，则选取左子数组元素，并且 i++ + // 否则，若“右子数组已全部合并完”或“左子数组元素 <= 右子数组元素”，则选取左子数组元素，并且 i++ } else if (j > rightEnd || tmp[i] <= tmp[j]) { nums[k] = tmp[i++]; - // 否则，若“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++ + // 否则，若“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++ } else { nums[k] = tmp[j++]; } diff --git a/codes/typescript/module/ListNode.ts b/codes/typescript/module/ListNode.ts index 17fdbb95..fae30d48 100644 --- a/codes/typescript/module/ListNode.ts +++ b/codes/typescript/module/ListNode.ts @@ -14,4 +14,19 @@ export default class ListNode { this.val = val === undefined ? 0 : val; this.next = next === undefined ? null : next; } + + /** + * Generate a linked list with an array + * @param arr + * @return + */ + arrToLinkedList(arr: number[]): ListNode | null { + const dum: ListNode = new ListNode(0); + let head = dum; + for (const val of arr) { + head.next = new ListNode(val); + head = head.next; + } + return dum.next; + } } diff --git a/codes/zig/build.zig b/codes/zig/build.zig index b04b3fd1..4299c60f 100644 --- a/codes/zig/build.zig +++ b/codes/zig/build.zig @@ -1,46 +1,232 @@ +// File: build.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + const std = @import("std"); -// zig version 0.10.0 +// Zig Version: 0.10.0 +// Build Command: zig build pub fn build(b: *std.build.Builder) void { const target = b.standardTargetOptions(.{}); const mode = b.standardReleaseOptions(); - // "chapter_computational_complexity/time_complexity.zig" - // Run Command: zig build run_time_complexity - const exe_time_complexity = b.addExecutable("time_complexity", "chapter_computational_complexity/time_complexity.zig"); - exe_time_complexity.addPackagePath("include", "include/include.zig"); - exe_time_complexity.setTarget(target); - exe_time_complexity.setBuildMode(mode); - exe_time_complexity.install(); - const run_cmd_time_complexity = exe_time_complexity.run(); - run_cmd_time_complexity.step.dependOn(b.getInstallStep()); - if (b.args) |args| run_cmd_time_complexity.addArgs(args); - const run_step_time_complexity = b.step("run_time_complexity", "Run time_complexity"); - run_step_time_complexity.dependOn(&run_cmd_time_complexity.step); + // Section: "Time Complexity" + // Source File: "chapter_computational_complexity/time_complexity.zig" + // Run Command: zig build run_time_complexity + const exe_time_complexity = b.addExecutable("time_complexity", "chapter_computational_complexity/time_complexity.zig"); + exe_time_complexity.addPackagePath("include", "include/include.zig"); + exe_time_complexity.setTarget(target); + exe_time_complexity.setBuildMode(mode); + exe_time_complexity.install(); + const run_cmd_time_complexity = exe_time_complexity.run(); + run_cmd_time_complexity.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_time_complexity.addArgs(args); + const run_step_time_complexity = b.step("run_time_complexity", "Run time_complexity"); + run_step_time_complexity.dependOn(&run_cmd_time_complexity.step); - // "chapter_computational_complexity/worst_best_time_complexity.zig" - // Run Command: zig build run_worst_best_time_complexity - const exe_worst_best_time_complexity = b.addExecutable("worst_best_time_complexity", "chapter_computational_complexity/worst_best_time_complexity.zig"); - exe_worst_best_time_complexity.addPackagePath("include", "include/include.zig"); - exe_worst_best_time_complexity.setTarget(target); - exe_worst_best_time_complexity.setBuildMode(mode); - exe_worst_best_time_complexity.install(); - const run_cmd_worst_best_time_complexity = exe_worst_best_time_complexity.run(); - run_cmd_worst_best_time_complexity.step.dependOn(b.getInstallStep()); - if (b.args) |args| run_cmd_worst_best_time_complexity.addArgs(args); - const run_step_worst_best_time_complexity = b.step("run_worst_best_time_complexity", "Run worst_best_time_complexity"); - run_step_worst_best_time_complexity.dependOn(&run_cmd_worst_best_time_complexity.step); + // Source File: "chapter_computational_complexity/worst_best_time_complexity.zig" + // Run Command: zig build run_worst_best_time_complexity + const exe_worst_best_time_complexity = b.addExecutable("worst_best_time_complexity", "chapter_computational_complexity/worst_best_time_complexity.zig"); + exe_worst_best_time_complexity.addPackagePath("include", "include/include.zig"); + exe_worst_best_time_complexity.setTarget(target); + exe_worst_best_time_complexity.setBuildMode(mode); + exe_worst_best_time_complexity.install(); + const run_cmd_worst_best_time_complexity = exe_worst_best_time_complexity.run(); + run_cmd_worst_best_time_complexity.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_worst_best_time_complexity.addArgs(args); + const run_step_worst_best_time_complexity = b.step("run_worst_best_time_complexity", "Run worst_best_time_complexity"); + run_step_worst_best_time_complexity.dependOn(&run_cmd_worst_best_time_complexity.step); - // "chapter_computational_complexity/leetcode_two_sum.zig" - // Run Command: zig build run_leetcode_two_sum - const exe_leetcode_two_sum = b.addExecutable("leetcode_two_sum", "chapter_computational_complexity/leetcode_two_sum.zig"); - exe_leetcode_two_sum.addPackagePath("include", "include/include.zig"); - exe_leetcode_two_sum.setTarget(target); - exe_leetcode_two_sum.setBuildMode(mode); - exe_leetcode_two_sum.install(); - const run_cmd_leetcode_two_sum = exe_leetcode_two_sum.run(); - run_cmd_leetcode_two_sum.step.dependOn(b.getInstallStep()); - if (b.args) |args| run_cmd_leetcode_two_sum.addArgs(args); - const run_step_leetcode_two_sum = b.step("run_leetcode_two_sum", "Run leetcode_two_sum"); - run_step_leetcode_two_sum.dependOn(&run_cmd_leetcode_two_sum.step); + // Section: "Space Complexity" + // Source File: "chapter_computational_complexity/space_complexity.zig" + // Run Command: zig build run_space_complexity + const exe_space_complexity = b.addExecutable("space_complexity", "chapter_computational_complexity/space_complexity.zig"); + exe_space_complexity.addPackagePath("include", "include/include.zig"); + exe_space_complexity.setTarget(target); + exe_space_complexity.setBuildMode(mode); + exe_space_complexity.install(); + const run_cmd_space_complexity = exe_space_complexity.run(); + run_cmd_space_complexity.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_space_complexity.addArgs(args); + const run_step_space_complexity = b.step("run_space_complexity", "Run space_complexity"); + run_step_space_complexity.dependOn(&run_cmd_space_complexity.step); + + // Section: "Space Time Tradeoff" + // Source File: "chapter_computational_complexity/leetcode_two_sum.zig" + // Run Command: zig build run_leetcode_two_sum + const exe_leetcode_two_sum = b.addExecutable("leetcode_two_sum", "chapter_computational_complexity/leetcode_two_sum.zig"); + exe_leetcode_two_sum.addPackagePath("include", "include/include.zig"); + exe_leetcode_two_sum.setTarget(target); + exe_leetcode_two_sum.setBuildMode(mode); + exe_leetcode_two_sum.install(); + const run_cmd_leetcode_two_sum = exe_leetcode_two_sum.run(); + run_cmd_leetcode_two_sum.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_leetcode_two_sum.addArgs(args); + const run_step_leetcode_two_sum = b.step("run_leetcode_two_sum", "Run leetcode_two_sum"); + run_step_leetcode_two_sum.dependOn(&run_cmd_leetcode_two_sum.step); + + // Section: "Array" + // Source File: "chapter_array_and_linkedlist/array.zig" + // Run Command: zig build run_array + const exe_array = b.addExecutable("array", "chapter_array_and_linkedlist/array.zig"); + exe_array.addPackagePath("include", "include/include.zig"); + exe_array.setTarget(target); + exe_array.setBuildMode(mode); + exe_array.install(); + const run_cmd_array = exe_array.run(); + run_cmd_array.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_array.addArgs(args); + const run_step_array = b.step("run_array", "Run array"); + run_step_array.dependOn(&run_cmd_array.step); + + // Section: "LinkedList" + // Source File: "chapter_array_and_linkedlist/linked_list.zig" + // Run Command: zig build run_linked_list + const exe_linked_list = b.addExecutable("linked_list", "chapter_array_and_linkedlist/linked_list.zig"); + exe_linked_list.addPackagePath("include", "include/include.zig"); + exe_linked_list.setTarget(target); + exe_linked_list.setBuildMode(mode); + exe_linked_list.install(); + const run_cmd_linked_list = exe_linked_list.run(); + run_cmd_linked_list.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_linked_list.addArgs(args); + const run_step_linked_list = b.step("run_linked_list", "Run linked_list"); + run_step_linked_list.dependOn(&run_cmd_linked_list.step); + + // Section: "List" + // Source File: "chapter_array_and_linkedlist/list.zig" + // Run Command: zig build run_list + const exe_list = b.addExecutable("list", "chapter_array_and_linkedlist/list.zig"); + exe_list.addPackagePath("include", "include/include.zig"); + exe_list.setTarget(target); + exe_list.setBuildMode(mode); + exe_list.install(); + const run_cmd_list = exe_list.run(); + run_cmd_list.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_list.addArgs(args); + const run_step_list = b.step("run_list", "Run list"); + run_step_list.dependOn(&run_cmd_list.step); + + // Source File: "chapter_array_and_linkedlist/my_list.zig" + // Run Command: zig build run_my_list + const exe_my_list = b.addExecutable("my_list", "chapter_array_and_linkedlist/my_list.zig"); + exe_my_list.addPackagePath("include", "include/include.zig"); + exe_my_list.setTarget(target); + exe_my_list.setBuildMode(mode); + exe_my_list.install(); + const run_cmd_my_list = exe_my_list.run(); + run_cmd_my_list.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_my_list.addArgs(args); + const run_step_my_list = b.step("run_my_list", "Run my_list"); + run_step_my_list.dependOn(&run_cmd_my_list.step); + + // Section: "Stack" + // Source File: "chapter_stack_and_queue/stack.zig" + // Run Command: zig build run_stack + const exe_stack = b.addExecutable("stack", "chapter_stack_and_queue/stack.zig"); + exe_stack.addPackagePath("include", "include/include.zig"); + exe_stack.setTarget(target); + exe_stack.setBuildMode(mode); + exe_stack.install(); + const run_cmd_stack = exe_stack.run(); + run_cmd_stack.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_stack.addArgs(args); + const run_step_stack = b.step("run_stack", "Run stack"); + run_step_stack.dependOn(&run_cmd_stack.step); + + // Source File: "chapter_stack_and_queue/linkedlist_stack.zig" + // Run Command: zig build run_linkedlist_stack + const exe_linkedlist_stack = b.addExecutable("linkedlist_stack", "chapter_stack_and_queue/linkedlist_stack.zig"); + exe_linkedlist_stack.addPackagePath("include", "include/include.zig"); + exe_linkedlist_stack.setTarget(target); + exe_linkedlist_stack.setBuildMode(mode); + exe_linkedlist_stack.install(); + const run_cmd_linkedlist_stack = exe_linkedlist_stack.run(); + run_cmd_linkedlist_stack.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_linkedlist_stack.addArgs(args); + const run_step_linkedlist_stack = b.step("run_linkedlist_stack", "Run linkedlist_stack"); + run_step_linkedlist_stack.dependOn(&run_cmd_linkedlist_stack.step); + + // Source File: "chapter_stack_and_queue/array_stack.zig" + // Run Command: zig build run_array_stack + const exe_array_stack = b.addExecutable("array_stack", "chapter_stack_and_queue/array_stack.zig"); + exe_array_stack.addPackagePath("include", "include/include.zig"); + exe_array_stack.setTarget(target); + exe_array_stack.setBuildMode(mode); + exe_array_stack.install(); + const run_cmd_array_stack = exe_linkedlist_stack.run(); + run_cmd_array_stack.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_array_stack.addArgs(args); + const run_step_array_stack = b.step("run_array_stack", "Run array_stack"); + run_step_array_stack.dependOn(&run_cmd_array_stack.step); + + // Section: "Hash Map" + // Source File: "chapter_hashing/hash_map.zig" + // Run Command: zig build run_hash_map + const exe_hash_map = b.addExecutable("hash_map", "chapter_hashing/hash_map.zig"); + exe_hash_map.addPackagePath("include", "include/include.zig"); + exe_hash_map.setTarget(target); + exe_hash_map.setBuildMode(mode); + exe_hash_map.install(); + const run_cmd_hash_map = exe_hash_map.run(); + run_cmd_hash_map.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_hash_map.addArgs(args); + const run_step_hash_map= b.step("run_hash_map", "Run hash_map"); + run_step_hash_map.dependOn(&run_cmd_hash_map.step); + + // Section: "Binary Tree" + // Source File: "chapter_tree/binary_tree.zig" + // Run Command: zig build run_binary_tree + const exe_binary_tree = b.addExecutable("hash_map", "chapter_tree/binary_tree.zig"); + exe_binary_tree.addPackagePath("include", "include/include.zig"); + exe_binary_tree.setTarget(target); + exe_binary_tree.setBuildMode(mode); + exe_binary_tree.install(); + const run_cmd_binary_tree = exe_binary_tree.run(); + run_cmd_binary_tree.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_binary_tree.addArgs(args); + const run_step_binary_tree= b.step("run_binary_tree", "Run binary_tree"); + run_step_binary_tree.dependOn(&run_cmd_binary_tree.step); + + // Section: "Linear Search" + // Source File: "chapter_searching/linear_search.zig" + // Run Command: zig build run_linear_search + const exe_linear_search = b.addExecutable("linear_search", "chapter_searching/linear_search.zig"); + exe_linear_search.addPackagePath("include", "include/include.zig"); + exe_linear_search.setTarget(target); + exe_linear_search.setBuildMode(mode); + exe_linear_search.install(); + const run_cmd_linear_search = exe_linear_search.run(); + run_cmd_linear_search.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_linear_search.addArgs(args); + const run_step_linear_search= b.step("run_linear_search", "Run linear_search"); + run_step_linear_search.dependOn(&run_cmd_linear_search.step); + + // Section: "Bubble Sort" + // Source File: "chapter_sorting/bubble_sort.zig" + // Run Command: zig build run_bubble_sort + const exe_bubble_sort = b.addExecutable("bubble_sort", "chapter_sorting/bubble_sort.zig"); + exe_bubble_sort.addPackagePath("include", "include/include.zig"); + exe_bubble_sort.setTarget(target); + exe_bubble_sort.setBuildMode(mode); + exe_bubble_sort.install(); + const run_cmd_bubble_sort = exe_bubble_sort.run(); + run_cmd_bubble_sort.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_bubble_sort.addArgs(args); + const run_step_bubble_sort = b.step("run_bubble_sort", "Run bubble_sort"); + run_step_bubble_sort.dependOn(&run_cmd_bubble_sort.step); + + // Section: "Insertion Sort" + // Source File: "chapter_sorting/insertion_sort.zig" + // Run Command: zig build run_insertion_sort + const exe_insertion_sort = b.addExecutable("insertion_sort", "chapter_sorting/insertion_sort.zig"); + exe_insertion_sort.addPackagePath("include", "include/include.zig"); + exe_insertion_sort.setTarget(target); + exe_insertion_sort.setBuildMode(mode); + exe_insertion_sort.install(); + const run_cmd_insertion_sort = exe_insertion_sort.run(); + run_cmd_insertion_sort.step.dependOn(b.getInstallStep()); + if (b.args) |args| run_cmd_insertion_sort.addArgs(args); + const run_step_insertion_sort = b.step("run_insertion_sort", "Run insertion_sort"); + run_step_insertion_sort.dependOn(&run_cmd_insertion_sort.step); } diff --git a/codes/zig/chapter_array_and_linkedlist/array.zig b/codes/zig/chapter_array_and_linkedlist/array.zig new file mode 100644 index 00000000..8c830cf4 --- /dev/null +++ b/codes/zig/chapter_array_and_linkedlist/array.zig @@ -0,0 +1,117 @@ +// File: array.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 随机返回一个数组元素 +pub fn randomAccess(nums: []i32) i32 { + // 在区间 [0, nums.len) 中随机抽取一个整数 + var randomIndex = std.crypto.random.intRangeLessThan(usize, 0, nums.len); + // 获取并返回随机元素 + var randomNum = nums[randomIndex]; + return randomNum; +} + +// 扩展数组长度 +pub fn extend(mem_allocator: std.mem.Allocator, nums: []i32, enlarge: usize) ![]i32 { + // 初始化一个扩展长度后的数组 + var res = try mem_allocator.alloc(i32, nums.len + enlarge); + std.mem.set(i32, res, 0); + // 将原数组中的所有元素复制到新数组 + std.mem.copy(i32, res, nums); + // 返回扩展后的新数组 + return res; +} + +// 在数组的索引 index 处插入元素 num +pub fn insert(nums: []i32, num: i32, index: usize) void { + // 把索引 index 以及之后的所有元素向后移动一位 + var i = nums.len - 1; + while (i > index) : (i -= 1) { + nums[i] = nums[i - 1]; + } + // 将 num 赋给 index 处元素 + nums[index] = num; +} + +// 删除索引 index 处元素 +pub fn remove(nums: []i32, index: usize) void { + // 把索引 index 之后的所有元素向前移动一位 + var i = index; + while (i < nums.len - 1) : (i += 1) { + nums[i] = nums[i + 1]; + } +} + +// 遍历数组 +pub fn traverse(nums: []i32) void { + var count: i32 = 0; + // 通过索引遍历数组 + var i: i32 = 0; + while (i < nums.len) : (i += 1) { + count += 1; + } + count = 0; + // 直接遍历数组 + for (nums) |_| { + count += 1; + } +} + +// 在数组中查找指定元素 +pub fn find(nums: []i32, target: i32) i32 { + for (nums) |num, i| { + if (num == target) return @intCast(i32, i); + } + return -1; +} + +// Driver Code +pub fn main() !void { + // 初始化数组 + const size: i32 = 5; + var arr = [_]i32{0} ** size; + std.debug.print("数组 arr = ", .{}); + inc.PrintUtil.printArray(i32, &arr); + + var array = [_]i32{ 1, 3, 2, 5, 4 }; + std.debug.print("\n数组 nums = ", .{}); + inc.PrintUtil.printArray(i32, &array); + + // 随机访问 + var randomNum = randomAccess(&array); + std.debug.print("\n在 nums 中获取随机元素 {}", .{randomNum}); + + // 长度扩展 + var known_at_runtime_zero: usize = 0; + var nums: []i32 = array[known_at_runtime_zero..array.len]; + var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); + defer mem_arena.deinit(); + const mem_allocator = mem_arena.allocator(); + nums = try extend(mem_allocator, nums, 3); + std.debug.print("\n将数组长度扩展至 8 ，得到 nums = ", .{}); + inc.PrintUtil.printArray(i32, nums); + + // 插入元素 + insert(nums, 6, 3); + std.debug.print("\n在索引 3 处插入数字 6 ，得到 nums = ", .{}); + inc.PrintUtil.printArray(i32, nums); + + // 删除元素 + remove(nums, 2); + std.debug.print("\n删除索引 2 处的元素，得到 nums = ", .{}); + inc.PrintUtil.printArray(i32, nums); + + // 遍历数组 + traverse(nums); + + // 查找元素 + var index = find(nums, 3); + std.debug.print("\n在 nums 中查找元素 3 ，得到索引 = {}\n", .{index}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_array_and_linkedlist/linked_list.zig b/codes/zig/chapter_array_and_linkedlist/linked_list.zig new file mode 100644 index 00000000..fbaa3f8d --- /dev/null +++ b/codes/zig/chapter_array_and_linkedlist/linked_list.zig @@ -0,0 +1,85 @@ +// File: linked_list.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 在链表的结点 n0 之后插入结点 P +pub fn insert(n0: ?*inc.ListNode(i32), P: ?*inc.ListNode(i32)) void { + var n1 = n0.?.next; + n0.?.next = P; + P.?.next = n1; +} + +// 删除链表的结点 n0 之后的首个结点 +pub fn remove(n0: ?*inc.ListNode(i32)) void { + if (n0.?.next == null) return; + // n0 -> P -> n1 + var P = n0.?.next; + var n1 = P.?.next; + n0.?.next = n1; +} + +// 访问链表中索引为 index 的结点 +pub fn access(node: ?*inc.ListNode(i32), index: i32) ?*inc.ListNode(i32) { + var head = node; + var i: i32 = 0; + while (i < index) : (i += 1) { + head = head.?.next; + if (head == null) return null; + } + return head; +} + +// 在链表中查找值为 target 的首个结点 +pub fn find(node: ?*inc.ListNode(i32), target: i32) i32 { + var head = node; + var index: i32 = 0; + while (head != null) { + if (head.?.val == target) return index; + head = head.?.next; + index += 1; + } + return -1; +} + +// Driver Code +pub fn main() !void { + // 初始化链表 + // 初始化各个结点 + var n0 = inc.ListNode(i32){.val = 1}; + var n1 = inc.ListNode(i32){.val = 3}; + var n2 = inc.ListNode(i32){.val = 2}; + var n3 = inc.ListNode(i32){.val = 5}; + var n4 = inc.ListNode(i32){.val = 4}; + // 构建引用指向 + n0.next = &n1; + n1.next = &n2; + n2.next = &n3; + n3.next = &n4; + std.debug.print("初始化的链表为", .{}); + try inc.PrintUtil.printLinkedList(i32, &n0); + + // 插入结点 + var tmp = inc.ListNode(i32){.val = 0}; + insert(&n0, &tmp); + std.debug.print("插入结点后的链表为", .{}); + try inc.PrintUtil.printLinkedList(i32, &n0); + + // 删除结点 + remove(&n0); + std.debug.print("删除结点后的链表为", .{}); + try inc.PrintUtil.printLinkedList(i32, &n0); + + // 访问结点 + var node = access(&n0, 3); + std.debug.print("链表中索引 3 处的结点的值 = {}\n", .{node.?.val}); + + // 查找结点 + var index = find(&n0, 2); + std.debug.print("链表中值为 2 的结点的索引 = {}\n", .{index}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} \ No newline at end of file diff --git a/codes/zig/chapter_array_and_linkedlist/list.zig b/codes/zig/chapter_array_and_linkedlist/list.zig new file mode 100644 index 00000000..608bce96 --- /dev/null +++ b/codes/zig/chapter_array_and_linkedlist/list.zig @@ -0,0 +1,81 @@ +// File: list.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// Driver Code +pub fn main() !void { + // 初始化列表 + var list = std.ArrayList(i32).init(std.heap.page_allocator); + // 延迟释放内存 + defer list.deinit(); + try list.appendSlice(&[_]i32{ 1, 3, 2, 5, 4 }); + std.debug.print("列表 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 访问元素 + var num = list.items[1]; + std.debug.print("\n访问索引 1 处的元素，得到 num = {}", .{num}); + + // 更新元素 + list.items[1] = 0; + std.debug.print("\n将索引 1 处的元素更新为 0 ，得到 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 清空列表 + list.clearRetainingCapacity(); + std.debug.print("\n清空列表后 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 尾部添加元素 + try list.append(1); + try list.append(3); + try list.append(2); + try list.append(5); + try list.append(4); + std.debug.print("\n添加元素后 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 中间插入元素 + try list.insert(3, 6); + std.debug.print("\n在索引 3 处插入数字 6 ，得到 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 删除元素 + var value = list.orderedRemove(3); + _ = value; + std.debug.print("\n删除索引 3 处的元素，得到 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 通过索引遍历列表 + var count: i32 = 0; + var i: i32 = 0; + while (i < list.items.len) : (i += 1) { + count += 1; + } + + // 直接遍历列表元素 + count = 0; + for (list.items) |_| { + count += 1; + } + + // 拼接两个列表 + var list1 = std.ArrayList(i32).init(std.heap.page_allocator); + defer list1.deinit(); + try list1.appendSlice(&[_]i32{ 6, 8, 7, 10, 9 }); + try list.insertSlice(list.items.len, list1.items); + std.debug.print("\n将列表 list1 拼接到 list 之后，得到 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + // 排序列表 + std.sort.sort(i32, list.items, {}, comptime std.sort.asc(i32)); + std.debug.print("\n排序列表后 list = ", .{}); + inc.PrintUtil.printList(i32, list); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_array_and_linkedlist/my_list.zig b/codes/zig/chapter_array_and_linkedlist/my_list.zig new file mode 100644 index 00000000..f018e61c --- /dev/null +++ b/codes/zig/chapter_array_and_linkedlist/my_list.zig @@ -0,0 +1,177 @@ +// File: my_list.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 列表类简易实现 +// 编译期泛型 +pub fn MyList(comptime T: type) type { + return struct { + const Self = @This(); + + nums: []T = undefined, // 数组（存储列表元素） + numsCapacity: usize = 10, // 列表容量 + numSize: usize = 0, // 列表长度（即当前元素数量） + extendRatio: usize = 2, // 每次列表扩容的倍数 + mem_arena: ?std.heap.ArenaAllocator = null, + mem_allocator: std.mem.Allocator = undefined, // 内存分配器 + + // 构造函数（分配内存+初始化列表） + pub fn init(self: *Self, allocator: std.mem.Allocator) !void { + if (self.mem_arena == null) { + self.mem_arena = std.heap.ArenaAllocator.init(allocator); + self.mem_allocator = self.mem_arena.?.allocator(); + } + self.nums = try self.mem_allocator.alloc(T, self.numsCapacity); + std.mem.set(T, self.nums, @as(T, 0)); + } + + // 析构函数（释放内存） + pub fn deinit(self: *Self) void { + if (self.mem_arena == null) return; + self.mem_arena.?.deinit(); + } + + // 获取列表长度（即当前元素数量） + pub fn size(self: *Self) usize { + return self.numSize; + } + + // 获取列表容量 + pub fn capacity(self: *Self) usize { + return self.numsCapacity; + } + + // 访问元素 + pub fn get(self: *Self, index: usize) T { + // 索引如果越界则抛出异常，下同 + if (index >= self.size()) @panic("索引越界"); + return self.nums[index]; + } + + // 更新元素 + pub fn set(self: *Self, index: usize, num: T) void { + // 索引如果越界则抛出异常，下同 + if (index >= self.size()) @panic("索引越界"); + self.nums[index] = num; + } + + // 尾部添加元素 + pub fn add(self: *Self, num: T) !void { + // 元素数量超出容量时，触发扩容机制 + if (self.size() == self.capacity()) try self.extendCapacity(); + self.nums[self.size()] = num; + // 更新元素数量 + self.numSize += 1; + } + + // 中间插入元素 + pub fn insert(self: *Self, index: usize, num: T) !void { + if (index >= self.size()) @panic("索引越界"); + // 元素数量超出容量时，触发扩容机制 + if (self.size() == self.capacity()) try self.extendCapacity(); + // 索引 i 以及之后的元素都向后移动一位 + var j = self.size() - 1; + while (j >= index) : (j -= 1) { + self.nums[j + 1] = self.nums[j]; + } + self.nums[index] = num; + // 更新元素数量 + self.numSize += 1; + } + + // 删除元素 + pub fn remove(self: *Self, index: usize) T { + if (index >= self.size()) @panic("索引越界"); + var num = self.nums[index]; + // 索引 i 之后的元素都向前移动一位 + var j = index; + while (j < self.size() - 1) : (j += 1) { + self.nums[j] = self.nums[j + 1]; + } + // 更新元素数量 + self.numSize -= 1; + // 返回被删除元素 + return num; + } + + // 列表扩容 + pub fn extendCapacity(self: *Self) !void { + // 新建一个长度为 size * extendRatio 的数组，并将原数组拷贝到新数组 + var newCapacity = self.capacity() * self.extendRatio; + var extend = try self.mem_allocator.alloc(T, newCapacity); + std.mem.set(T, extend, @as(T, 0)); + // 将原数组中的所有元素复制到新数组 + std.mem.copy(T, extend, self.nums); + self.nums = extend; + // 更新列表容量 + self.numsCapacity = newCapacity; + } + + // 将列表转换为数组 + pub fn toArray(self: *Self) ![]T { + // 仅转换有效长度范围内的列表元素 + var nums = try self.mem_allocator.alloc(T, self.size()); + std.mem.set(T, nums, @as(T, 0)); + for (nums) |*num, i| { + num.* = self.get(i); + } + return nums; + } + }; +} + +// Driver Code +pub fn main() !void { + // 初始化列表 + var list = MyList(i32){}; + try list.init(std.heap.page_allocator); + // 延迟释放内存 + defer list.deinit(); + + // 尾部添加元素 + try list.add(1); + try list.add(3); + try list.add(2); + try list.add(5); + try list.add(4); + std.debug.print("列表 list = ", .{}); + inc.PrintUtil.printArray(i32, try list.toArray()); + std.debug.print(" ，容量 = {} ，长度 = {}", .{list.capacity(), list.size()}); + + // 中间插入元素 + try list.insert(3, 6); + std.debug.print("\n在索引 3 处插入数字 6 ，得到 list = ", .{}); + inc.PrintUtil.printArray(i32, try list.toArray()); + + // 删除元素 + _ = list.remove(3); + std.debug.print("\n删除索引 3 处的元素，得到 list = ", .{}); + inc.PrintUtil.printArray(i32, try list.toArray()); + + // 访问元素 + var num = list.get(1); + std.debug.print("\n访问索引 1 处的元素，得到 num = {}", .{num}); + + // 更新元素 + list.set(1, 0); + std.debug.print("\n将索引 1 处的元素更新为 0 ，得到 list = ", .{}); + inc.PrintUtil.printArray(i32, try list.toArray()); + + // 测试扩容机制 + list.set(1, 0); + var i: i32 = 0; + while (i < 10) : (i += 1) { + // 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制 + try list.add(i); + } + std.debug.print("\n扩容后的列表 list = ", .{}); + inc.PrintUtil.printArray(i32, try list.toArray()); + std.debug.print(" ，容量 = {} ，长度 = {}\n", .{list.capacity(), list.size()}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_computational_complexity/space_complexity.zig b/codes/zig/chapter_computational_complexity/space_complexity.zig new file mode 100644 index 00000000..9798821a --- /dev/null +++ b/codes/zig/chapter_computational_complexity/space_complexity.zig @@ -0,0 +1,125 @@ +// File: space_complexity.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 函数 +fn function() i32 { + // do something + return 0; +} + +// 常数阶 +fn constant(n: i32) void { + // 常量、变量、对象占用 O(1) 空间 + const a: i32 = 0; + var b: i32 = 0; + var nums = [_]i32{0}**10000; + var node = inc.ListNode(i32){.val = 0}; + var i: i32 = 0; + // 循环中的变量占用 O(1) 空间 + while (i < n) : (i += 1) { + var c: i32 = 0; + _ = c; + } + // 循环中的函数占用 O(1) 空间 + i = 0; + while (i < n) : (i += 1) { + _ = function(); + } + _ = a; + _ = b; + _ = nums; + _ = node; +} + +// 线性阶 +fn linear(comptime n: i32) !void { + // 长度为 n 的数组占用 O(n) 空间 + var nums = [_]i32{0}**n; + // 长度为 n 的列表占用 O(n) 空间 + var nodes = std.ArrayList(i32).init(std.heap.page_allocator); + defer nodes.deinit(); + var i: i32 = 0; + while (i < n) : (i += 1) { + try nodes.append(i); + } + // 长度为 n 的哈希表占用 O(n) 空间 + var map = std.AutoArrayHashMap(i32, []const u8).init(std.heap.page_allocator); + defer map.deinit(); + var j: i32 = 0; + while (j < n) : (j += 1) { + const string = try std.fmt.allocPrint(std.heap.page_allocator, "{d}", .{j}); + defer std.heap.page_allocator.free(string); + try map.put(i, string); + } + _ = nums; +} + +// 线性阶（递归实现） +fn linearRecur(comptime n: i32) void { + std.debug.print("递归 n = {}\n", .{n}); + if (n == 1) return; + linearRecur(n - 1); +} + +// 平方阶 +fn quadratic(n: i32) !void { + // 二维列表占用 O(n^2) 空间 + var nodes = std.ArrayList(std.ArrayList(i32)).init(std.heap.page_allocator); + defer nodes.deinit(); + var i: i32 = 0; + while (i < n) : (i += 1) { + var tmp = std.ArrayList(i32).init(std.heap.page_allocator); + defer tmp.deinit(); + var j: i32 = 0; + while (j < n) : (j += 1) { + try tmp.append(0); + } + try nodes.append(tmp); + } +} + +// 平方阶（递归实现） +fn quadraticRecur(comptime n: i32) i32 { + if (n <= 0) return 0; + var nums = [_]i32{0}**n; + std.debug.print("递归 n = {} 中的 nums 长度 = {}\n", .{n, nums.len}); + return quadraticRecur(n - 1); +} + +// 指数阶（建立满二叉树） +fn buildTree(mem_allocator: std.mem.Allocator, n: i32) !?*inc.TreeNode(i32) { + if (n == 0) return null; + const root = try mem_allocator.create(inc.TreeNode(i32)); + root.init(0); + root.left = try buildTree(mem_allocator, n - 1); + root.right = try buildTree(mem_allocator, n - 1); + return root; +} + +// Driver Code +pub fn main() !void { + const n: i32 = 5; + // 常数阶 + constant(n); + // 线性阶 + try linear(n); + linearRecur(n); + // 平方阶 + try quadratic(n); + _ = quadraticRecur(n); + // 指数阶 + var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); + defer mem_arena.deinit(); + var root = blk_root: { + const mem_allocator = mem_arena.allocator(); + break :blk_root try buildTree(mem_allocator, n); + }; + try inc.PrintUtil.printTree(root, null, false); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} \ No newline at end of file diff --git a/codes/zig/chapter_computational_complexity/time_complexity.zig b/codes/zig/chapter_computational_complexity/time_complexity.zig index dab17034..04795005 100644 --- a/codes/zig/chapter_computational_complexity/time_complexity.zig +++ b/codes/zig/chapter_computational_complexity/time_complexity.zig @@ -59,11 +59,13 @@ fn bubbleSort(nums: []i32) i32 { var j: usize = 0; // 内循环：冒泡操作 while (j < i) : (j += 1) { - // 交换 nums[j] 与 nums[j + 1] - var tmp = nums[j]; - nums[j] = nums[j + 1]; - nums[j + 1] = tmp; - count += 3; // 元素交换包含 3 个单元操作 + if (nums[j] > nums[j + 1]) { + // 交换 nums[j] 与 nums[j + 1] + var tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; + count += 3; // 元素交换包含 3 个单元操作 + } } } return count; @@ -138,7 +140,7 @@ fn factorialRecur(n: i32) i32 { } // Driver Code -pub fn main() void { +pub fn main() !void { // 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势 const n: i32 = 8; std.debug.print("输入数据大小 n = {}\n", .{n}); diff --git a/codes/zig/chapter_computational_complexity/worst_best_time_complexity.zig b/codes/zig/chapter_computational_complexity/worst_best_time_complexity.zig index bd2a1464..0cdd61eb 100644 --- a/codes/zig/chapter_computational_complexity/worst_best_time_complexity.zig +++ b/codes/zig/chapter_computational_complexity/worst_best_time_complexity.zig @@ -27,7 +27,7 @@ pub fn findOne(nums: []i32) i32 { } // Driver Code -pub fn main() void { +pub fn main() !void { var i: i32 = 0; while (i < 10) : (i += 1) { const n: usize = 100; diff --git a/codes/zig/chapter_hashing/hash_map.zig b/codes/zig/chapter_hashing/hash_map.zig new file mode 100644 index 00000000..1e217c43 --- /dev/null +++ b/codes/zig/chapter_hashing/hash_map.zig @@ -0,0 +1,55 @@ +// File: hash_map.zig +// Created Time: 2023-01-13 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// Driver Code +pub fn main() !void { + // 初始化哈希表 + var map = std.AutoHashMap(i32, []const u8).init(std.heap.page_allocator); + // 延迟释放内存 + defer map.deinit(); + + // 添加操作 + // 在哈希表中添加键值对 (key, value) + try map.put(12836, "小哈"); + try map.put(15937, "小啰"); + try map.put(16750, "小算"); + try map.put(13276, "小法"); + try map.put(10583, "小鸭"); + std.debug.print("\n添加完成后，哈希表为\nKey -> Value\n", .{}); + inc.PrintUtil.printHashMap(i32, []const u8, map); + + // 查询操作 + // 向哈希表输入键 key ，得到值 value + var name = map.get(15937).?; + std.debug.print("\n输入学号 15937 ，查询到姓名 {s}\n", .{name}); + + // 删除操作 + // 在哈希表中删除键值对 (key, value) + _ = map.remove(10583); + std.debug.print("\n删除 10583 后，哈希表为\nKey -> Value\n", .{}); + inc.PrintUtil.printHashMap(i32, []const u8, map); + + // 遍历哈希表 + std.debug.print("\n遍历键值对 Key->Value\n", .{}); + inc.PrintUtil.printHashMap(i32, []const u8, map); + + std.debug.print("\n单独遍历键 Key\n", .{}); + var it = map.iterator(); + while (it.next()) |kv| { + std.debug.print("{}\n", .{kv.key_ptr.*}); + } + + std.debug.print("\n单独遍历值 value\n", .{}); + it = map.iterator(); + while (it.next()) |kv| { + std.debug.print("{s}\n", .{kv.value_ptr.*}); + } + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_searching/linear_search.zig b/codes/zig/chapter_searching/linear_search.zig new file mode 100644 index 00000000..3ba21313 --- /dev/null +++ b/codes/zig/chapter_searching/linear_search.zig @@ -0,0 +1,56 @@ +// File: linear_search.zig +// Created Time: 2023-01-13 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 线性查找（数组） +fn linearSearchList(comptime T: type, nums: std.ArrayList(T), target: T) T { + // 遍历数组 + for (nums.items) |num, i| { + // 找到目标元素， 返回其索引 + if (num == target) { + return @intCast(T, i); + } + } + // 未找到目标元素，返回 -1 + return -1; +} + +// 线性查找（链表） +pub fn linearSearchLinkedList(comptime T: type, node: ?*inc.ListNode(T), target: T) ?*inc.ListNode(T) { + var head = node; + // 遍历链表 + while (head != null) { + // 找到目标结点，返回之 + if (head.?.val == target) return head; + head = head.?.next; + } + return null; +} + +// Driver Code +pub fn main() !void { + var target: i32 = 3; + + // 在数组中执行线性查找 + var nums = std.ArrayList(i32).init(std.heap.page_allocator); + defer nums.deinit(); + try nums.appendSlice(&[_]i32{ 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 }); + var index = linearSearchList(i32, nums, target); + std.debug.print("目标元素 3 的索引 = {}\n", .{index}); + + // 在链表中执行线性查找 + var mem_arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); + defer mem_arena.deinit(); + const mem_allocator = mem_arena.allocator(); + var head = try inc.ListUtil.listToLinkedList(i32, mem_allocator, nums); + var node = linearSearchLinkedList(i32, head, target); + std.debug.print("目标结点值 3 的对应结点对象为 ", .{}); + try inc.PrintUtil.printLinkedList(i32, node); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_sorting/bubble_sort.zig b/codes/zig/chapter_sorting/bubble_sort.zig new file mode 100644 index 00000000..17cb0d97 --- /dev/null +++ b/codes/zig/chapter_sorting/bubble_sort.zig @@ -0,0 +1,62 @@ +// File: bubble_sort.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 冒泡排序 +fn bubbleSort(nums: []i32) void { + // 外循环：待排序元素数量为 n-1, n-2, ..., 1 + var i: usize = nums.len - 1; + while (i > 0) : (i -= 1) { + var j: usize = 0; + // 内循环：冒泡操作 + while (j < i) : (j += 1) { + if (nums[j] > nums[j + 1]) { + // 交换 nums[j] 与 nums[j + 1] + var tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; + } + } + } +} + +// 冒泡排序（标志优化） +fn bubbleSortWithFlag(nums: []i32) void { + // 外循环：待排序元素数量为 n-1, n-2, ..., 1 + var i: usize = nums.len - 1; + while (i > 0) : (i -= 1) { + var flag = false; // 初始化标志位 + var j: usize = 0; + // 内循环：冒泡操作 + while (j < i) : (j += 1) { + if (nums[j] > nums[j + 1]) { + // 交换 nums[j] 与 nums[j + 1] + var tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; + flag = true; + } + } + if (!flag) break; // 此轮冒泡未交换任何元素，直接跳出 + } +} + +// Driver Code +pub fn main() !void { + var nums = [_]i32{ 4, 1, 3, 1, 5, 2 }; + bubbleSort(&nums); + std.debug.print("冒泡排序完成后 nums = ", .{}); + inc.PrintUtil.printArray(i32, &nums); + + var nums1 = [_]i32{ 4, 1, 3, 1, 5, 2 }; + bubbleSortWithFlag(&nums1); + std.debug.print("\n冒泡排序完成后 nums1 = ", .{}); + inc.PrintUtil.printArray(i32, &nums1); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_sorting/insertion_sort.zig b/codes/zig/chapter_sorting/insertion_sort.zig new file mode 100644 index 00000000..5c954791 --- /dev/null +++ b/codes/zig/chapter_sorting/insertion_sort.zig @@ -0,0 +1,33 @@ +// File: insertion_sort.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 插入排序 +fn insertionSort(nums: []i32) void { + // 外循环：base = nums[1], nums[2], ..., nums[n-1] + var i: usize = 1; + while (i < nums.len) : (i += 1) { + var base = nums[i]; + var j: usize = i; + // 内循环：将 base 插入到左边的正确位置 + while (j >= 1 and nums[j - 1] > base) : (j -= 1) { + nums[j] = nums[j - 1]; // 1. 将 nums[j] 向右移动一位 + } + nums[j] = base; // 2. 将 base 赋值到正确位置 + } +} + +// Driver Code +pub fn main() !void { + var nums = [_]i32{ 4, 1, 3, 1, 5, 2 }; + insertionSort(&nums); + std.debug.print("插入排序完成后 nums = ", .{}); + inc.PrintUtil.printArray(i32, &nums); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_stack_and_queue/array_stack.zig b/codes/zig/chapter_stack_and_queue/array_stack.zig new file mode 100644 index 00000000..36b1c7ca --- /dev/null +++ b/codes/zig/chapter_stack_and_queue/array_stack.zig @@ -0,0 +1,99 @@ +// File: array_stack.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 基于数组实现的栈 +// 编译期泛型 +pub fn ArrayStack(comptime T: type) type { + return struct { + const Self = @This(); + + stack: ?std.ArrayList(T) = null, + + // 构造函数（分配内存+初始化栈） + pub fn init(self: *Self, allocator: std.mem.Allocator) void { + if (self.stack == null) { + self.stack = std.ArrayList(T).init(allocator); + } + } + + // 析构函数（释放内存） + pub fn deinit(self: *Self) void { + if (self.stack == null) return; + self.stack.?.deinit(); + } + + // 获取栈的长度 + pub fn size(self: *Self) usize { + return self.stack.?.items.len; + } + + // 判断栈是否为空 + pub fn empty(self: *Self) bool { + return self.size() == 0; + } + + // 访问栈顶元素 + pub fn top(self: *Self) T { + if (self.size() == 0) @panic("栈为空"); + return self.stack.?.items[self.size() - 1]; + } + + // 入栈 + pub fn push(self: *Self, num: T) !void { + try self.stack.?.append(num); + } + + // 出栈 + pub fn pop(self: *Self) T { + var num = self.stack.?.pop(); + return num; + } + + // 返回 ArrayList + pub fn toList(self: *Self) std.ArrayList(T) { + return self.stack.?; + } + }; +} + +// Driver Code +pub fn main() !void { + // 初始化栈 + var stack = ArrayStack(i32){}; + stack.init(std.heap.page_allocator); + // 延迟释放内存 + defer stack.deinit(); + + // 元素入栈 + try stack.push(1); + try stack.push(3); + try stack.push(2); + try stack.push(5); + try stack.push(4); + std.debug.print("栈 stack = ", .{}); + inc.PrintUtil.printList(i32, stack.toList()); + + // 访问栈顶元素 + var top = stack.top(); + std.debug.print("\n栈顶元素 top = {}", .{top}); + + // 元素出栈 + top = stack.pop(); + std.debug.print("\n出栈元素 pop = {}，出栈后 stack = ", .{top}); + inc.PrintUtil.printList(i32, stack.toList()); + + // 获取栈的长度 + var size = stack.size(); + std.debug.print("\n栈的长度 size = {}", .{size}); + + // 判断栈是否为空 + var empty = stack.empty(); + std.debug.print("\n栈是否为空 = {}", .{empty}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} diff --git a/codes/zig/chapter_stack_and_queue/linkedlist_stack.zig b/codes/zig/chapter_stack_and_queue/linkedlist_stack.zig new file mode 100644 index 00000000..633583b4 --- /dev/null +++ b/codes/zig/chapter_stack_and_queue/linkedlist_stack.zig @@ -0,0 +1,120 @@ +// File: linkedlist_stack.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// 基于链表实现的栈 +// 编译期泛型 +pub fn LinkedListStack(comptime T: type) type { + return struct { + const Self = @This(); + + stackTop: ?*inc.ListNode(T) = null, // 将头结点作为栈顶 + stkSize: usize = 0, // 栈的长度 + mem_arena: ?std.heap.ArenaAllocator = null, + mem_allocator: std.mem.Allocator = undefined, // 内存分配器 + + // 构造函数（分配内存+初始化栈） + pub fn init(self: *Self, allocator: std.mem.Allocator) !void { + if (self.mem_arena == null) { + self.mem_arena = std.heap.ArenaAllocator.init(allocator); + self.mem_allocator = self.mem_arena.?.allocator(); + } + self.stackTop = null; + self.stkSize = 0; + } + + // 析构函数（释放内存） + pub fn deinit(self: *Self) void { + if (self.mem_arena == null) return; + self.mem_arena.?.deinit(); + } + + // 获取栈的长度 + pub fn size(self: *Self) usize { + return self.stkSize; + } + + // 判断栈是否为空 + pub fn empty(self: *Self) bool { + return self.size() == 0; + } + + // 访问栈顶元素 + pub fn top(self: *Self) T { + if (self.size() == 0) @panic("栈为空"); + return self.stackTop.?.val; + } + + // 入栈 + pub fn push(self: *Self, num: T) !void { + var node = try self.mem_allocator.create(inc.ListNode(T)); + node.init(num); + node.next = self.stackTop; + self.stackTop = node; + self.stkSize += 1; + } + + // 出栈 + pub fn pop(self: *Self) T { + var num = self.top(); + self.stackTop = self.stackTop.?.next; + self.stkSize -= 1; + return num; + } + + // 将栈转换为数组 + pub fn toArray(self: *Self) ![]T { + var node = self.stackTop; + var res = try self.mem_allocator.alloc(T, self.size()); + std.mem.set(T, res, @as(T, 0)); + var i: usize = 0; + while (i < res.len) : (i += 1) { + res[res.len - i - 1] = node.?.val; + node = node.?.next; + } + return res; + } + }; +} + +// Driver Code +pub fn main() !void { + // 初始化栈 + var stack = LinkedListStack(i32){}; + try stack.init(std.heap.page_allocator); + // 延迟释放内存 + defer stack.deinit(); + + // 元素入栈 + try stack.push(1); + try stack.push(3); + try stack.push(2); + try stack.push(5); + try stack.push(4); + std.debug.print("栈 stack = ", .{}); + inc.PrintUtil.printArray(i32, try stack.toArray()); + + // 访问栈顶元素 + var top = stack.top(); + std.debug.print("\n栈顶元素 top = {}", .{top}); + + // 元素出栈 + top = stack.pop(); + std.debug.print("\n出栈元素 pop = {}，出栈后 stack = ", .{top}); + inc.PrintUtil.printArray(i32, try stack.toArray()); + + // 获取栈的长度 + var size = stack.size(); + std.debug.print("\n栈的长度 size = {}", .{size}); + + // 判断栈是否为空 + var empty = stack.empty(); + std.debug.print("\n栈是否为空 = {}", .{empty}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/chapter_stack_and_queue/stack.zig b/codes/zig/chapter_stack_and_queue/stack.zig new file mode 100644 index 00000000..95ed427b --- /dev/null +++ b/codes/zig/chapter_stack_and_queue/stack.zig @@ -0,0 +1,44 @@ +// File: stack.zig +// Created Time: 2023-01-08 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// Driver Code +pub fn main() !void { + // 初始化栈 + // 在 zig 中，推荐将 ArrayList 当作栈来使用 + var stack = std.ArrayList(i32).init(std.heap.page_allocator); + // 延迟释放内存 + defer stack.deinit(); + + // 元素入栈 + try stack.append(1); + try stack.append(3); + try stack.append(2); + try stack.append(5); + try stack.append(4); + std.debug.print("栈 stack = ", .{}); + inc.PrintUtil.printList(i32, stack); + + // 访问栈顶元素 + var top = stack.items[stack.items.len - 1]; + std.debug.print("\n栈顶元素 top = {}", .{top}); + + // 元素出栈 + top = stack.pop(); + std.debug.print("\n出栈元素 pop = {}，出栈后 stack = ", .{top}); + inc.PrintUtil.printList(i32, stack); + + // 获取栈的长度 + var size = stack.items.len; + std.debug.print("\n栈的长度 size = {}", .{size}); + + // 判断栈是否为空 + var empty = if (stack.items.len == 0) true else false; + std.debug.print("\n栈是否为空 = {}", .{empty}); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} diff --git a/codes/zig/chapter_tree/binary_tree.zig b/codes/zig/chapter_tree/binary_tree.zig new file mode 100644 index 00000000..b2cb9a96 --- /dev/null +++ b/codes/zig/chapter_tree/binary_tree.zig @@ -0,0 +1,40 @@ +// File: binary_tree.zig +// Created Time: 2023-01-14 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); +const inc = @import("include"); + +// Driver Code +pub fn main() !void { + // 初始化二叉树 + // 初始化结点 + var n1 = inc.TreeNode(i32){ .val = 1 }; + var n2 = inc.TreeNode(i32){ .val = 2 }; + var n3 = inc.TreeNode(i32){ .val = 3 }; + var n4 = inc.TreeNode(i32){ .val = 4 }; + var n5 = inc.TreeNode(i32){ .val = 5 }; + // 构建引用指向（即指针） + n1.left = &n2; + n1.right = &n3; + n2.left = &n4; + n2.right = &n5; + std.debug.print("初始化二叉树\n", .{}); + try inc.PrintUtil.printTree(&n1, null, false); + + // 插入与删除结点 + var p = inc.TreeNode(i32){ .val = 0 }; + // 在 n1 -> n2 中间插入结点 P + n1.left = &p; + p.left = &n2; + std.debug.print("插入结点 P 后\n", .{}); + try inc.PrintUtil.printTree(&n1, null, false); + // 删除结点 + n1.left = &n2; + std.debug.print("删除结点 P 后\n", .{}); + try inc.PrintUtil.printTree(&n1, null, false); + + const getchar = try std.io.getStdIn().reader().readByte(); + _ = getchar; +} + diff --git a/codes/zig/include/ListNode.zig b/codes/zig/include/ListNode.zig new file mode 100644 index 00000000..da7e667c --- /dev/null +++ b/codes/zig/include/ListNode.zig @@ -0,0 +1,36 @@ +// File: ListNode.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); + +// Definition for a singly-linked list node +// 编译期泛型 +pub fn ListNode(comptime T: type) type { + return struct { + const Self = @This(); + + val: T = 0, + next: ?*Self = null, + + // Initialize a list node with specific value + pub fn init(self: *Self, x: i32) void { + self.val = x; + self.next = null; + } + }; +} + +// Generate a linked list with a list +pub fn listToLinkedList(comptime T: type, mem_allocator: std.mem.Allocator, list: std.ArrayList(T)) !?*ListNode(T) { + var dum = try mem_allocator.create(ListNode(T)); + dum.init(0); + var head = dum; + for (list.items) |val| { + var tmp = try mem_allocator.create(ListNode(T)); + tmp.init(val); + head.next = tmp; + head = head.next.?; + } + return dum.next; +} \ No newline at end of file diff --git a/codes/zig/include/PrintUtil.zig b/codes/zig/include/PrintUtil.zig index 5adac2a6..d126acb3 100644 --- a/codes/zig/include/PrintUtil.zig +++ b/codes/zig/include/PrintUtil.zig @@ -1,13 +1,122 @@ -// File: TreeNode.zig +// File: PrintUtil.zig // Created Time: 2023-01-07 // Author: sjinzh (sjinzh@gmail.com) const std = @import("std"); +pub const ListUtil = @import("ListNode.zig"); +pub const ListNode = ListUtil.ListNode; +pub const TreeUtil = @import("TreeNode.zig"); +pub const TreeNode = TreeUtil.TreeNode; -// Print an Array +// Print an array pub fn printArray(comptime T: type, nums: []T) void { std.debug.print("[", .{}); - for (nums) |num, j| { - std.debug.print("{}{s}", .{num, if (j == nums.len-1) "]\n" else ", " }); - } + if (nums.len > 0) { + for (nums) |num, j| { + std.debug.print("{}{s}", .{num, if (j == nums.len-1) "]" else ", " }); + } + } else { + std.debug.print("]", .{}); + } } + +// Print a list +pub fn printList(comptime T: type, list: std.ArrayList(T)) void { + std.debug.print("[", .{}); + if (list.items.len > 0) { + for (list.items) |value, i| { + std.debug.print("{}{s}", .{value, if (i == list.items.len-1) "]" else ", " }); + } + } else { + std.debug.print("]", .{}); + } + +} + +// Print a linked list +pub fn printLinkedList(comptime T: type, node: ?*ListNode(T)) !void { + if (node == null) return; + var list = std.ArrayList(i32).init(std.heap.page_allocator); + defer list.deinit(); + var head = node; + while (head != null) { + try list.append(head.?.val); + head = head.?.next; + } + for (list.items) |value, i| { + std.debug.print("{}{s}", .{value, if (i == list.items.len-1) "\n" else "->" }); + } +} + +// Print a HashMap +pub fn printHashMap(comptime TKey: type, comptime TValue: type, map: std.AutoHashMap(TKey, TValue)) void { + var it = map.iterator(); + while (it.next()) |kv| { + var key = kv.key_ptr.*; + var value = kv.value_ptr.*; + std.debug.print("{} -> {s}\n", .{key, value}); + } +} + +// print a heap (PriorityQueue) +pub fn printHeap(comptime T: type, mem_allocator: std.mem.Allocator, queue: anytype) !void { + var arr = queue.items; + var len = queue.len; + std.debug.print("堆的数组表示：", .{}); + printArray(T, arr[0..len]); + std.debug.print("\n堆的树状表示：\n", .{}); + var root = try TreeUtil.arrToTree(T, mem_allocator, arr[0..len]); + try printTree(root, null, false); +} + +// This tree printer is borrowed from TECHIE DELIGHT +// https://www.techiedelight.com/c-program-print-binary-tree/ +const Trunk = struct { + prev: ?*Trunk = null, + str: []const u8 = undefined, + + pub fn init(self: *Trunk, prev: ?*Trunk, str: []const u8) void { + self.prev = prev; + self.str = str; + } +}; + +// Helper function to print branches of the binary tree +pub fn showTrunks(p: ?*Trunk) void { + if (p == null) return; + showTrunks(p.?.prev); + std.debug.print("{s}", .{p.?.str}); +} + +// The interface of the tree printer +// Print a binary tree +pub fn printTree(root: ?*TreeNode(i32), prev: ?*Trunk, isLeft: bool) !void { + if (root == null) { + return; + } + + var prev_str = " "; + var trunk = Trunk{.prev = prev, .str = prev_str}; + + try printTree(root.?.right, &trunk, true); + + if (prev == null) { + trunk.str = "———"; + } else if (isLeft) { + trunk.str = "/———"; + prev_str = " |"; + } else { + trunk.str = "\\———"; + prev.?.str = prev_str; + } + + showTrunks(&trunk); + std.debug.print(" {}\n", .{root.?.val}); + + if (prev) |_| { + prev.?.str = prev_str; + } + trunk.str = " |"; + + try printTree(root.?.left, &trunk, false); +} \ No newline at end of file diff --git a/codes/zig/include/TreeNode.zig b/codes/zig/include/TreeNode.zig new file mode 100644 index 00000000..7c1e2ad2 --- /dev/null +++ b/codes/zig/include/TreeNode.zig @@ -0,0 +1,60 @@ +// File: TreeNode.zig +// Created Time: 2023-01-07 +// Author: sjinzh (sjinzh@gmail.com) + +const std = @import("std"); + +// Definition for a binary tree node +// 编译期泛型 +pub fn TreeNode(comptime T: type) type { + return struct { + const Self = @This(); + + val: T = undefined, + left: ?*Self = null, + right: ?*Self = null, + + // Initialize a tree node with specific value + pub fn init(self: *Self, x: i32) void { + self.val = x; + self.left = null; + self.right = null; + } + }; +} + +// Generate a binary tree with an array +pub fn arrToTree(comptime T: type, mem_allocator: std.mem.Allocator, list: []T) !?*TreeNode(T) { + if (list.len == 0) return null; + var root = try mem_allocator.create(TreeNode(T)); + root.init(list[0]); + + const TailQueue = std.TailQueue(?*TreeNode(T)); + const TailQueueNode = std.TailQueue(?*TreeNode(T)).Node; + var que = TailQueue{}; + var node_root = TailQueueNode{ .data = root }; + que.append(&node_root); + var index: usize = 0; + while (que.len > 0) { + var node = que.popFirst(); + index += 1; + if (index >= list.len) break; + if (index < list.len) { + var tmp = try mem_allocator.create(TreeNode(T)); + tmp.init(list[index]); + node.?.data.?.left = tmp; + var a = TailQueueNode{ .data = node.?.data.?.left }; + que.append(&a); + } + index += 1; + if (index >= list.len) break; + if (index < list.len) { + var tmp = try mem_allocator.create(TreeNode(T)); + tmp.init(list[index]); + node.?.data.?.right = tmp; + var a = TailQueueNode{ .data = node.?.data.?.right }; + que.append(&a); + } + } + return root; +} \ No newline at end of file diff --git a/codes/zig/include/include.zig b/codes/zig/include/include.zig index b4f34782..42cd76cf 100644 --- a/codes/zig/include/include.zig +++ b/codes/zig/include/include.zig @@ -1,5 +1,9 @@ // File: include.zig -// Created Time: 2023-01-04 +// Created Time: 2023-01-07 // Author: sjinzh (sjinzh@gmail.com) -pub const PrintUtil = @import("PrintUtil.zig"); \ No newline at end of file +pub const PrintUtil = @import("PrintUtil.zig"); +pub const ListUtil = @import("ListNode.zig"); +pub const ListNode = ListUtil.ListNode; +pub const TreeUtil = @import("TreeNode.zig"); +pub const TreeNode = TreeUtil.TreeNode; \ No newline at end of file diff --git a/deploy.sh b/deploy.sh index 96a633cb..975d7b2f 100644 --- a/deploy.sh +++ b/deploy.sh @@ -3,6 +3,6 @@ mkdocs build --clean cd site git init git add -A -git commit -m 'deploy' +git commit -m "deploy" git push -f git@github.com:krahets/hello-algo.git master:gh-pages cd - diff --git a/docker-compose.yml b/docker-compose.yml new file mode 100644 index 00000000..6a472b17 --- /dev/null +++ b/docker-compose.yml @@ -0,0 +1,7 @@ +version: '3' +services: + hello-algo: + build: . + ports: + - "8000:8000" + \ No newline at end of file diff --git a/docs/chapter_array_and_linkedlist/array.md b/docs/chapter_array_and_linkedlist/array.md index 2251362d..fcbdf9ab 100644 --- a/docs/chapter_array_and_linkedlist/array.md +++ b/docs/chapter_array_and_linkedlist/array.md @@ -245,6 +245,8 @@ elementAddr = firtstElementAddr + elementLength * elementIndex for (int i = 0; i < size; i++) { res[i] = nums[i]; } + // 释放内存 + delete[] nums; // 返回扩展后的新数组 return res; } diff --git a/docs/chapter_array_and_linkedlist/list.md b/docs/chapter_array_and_linkedlist/list.md index 1a47a0d1..e57d4987 100644 --- a/docs/chapter_array_and_linkedlist/list.md +++ b/docs/chapter_array_and_linkedlist/list.md @@ -748,6 +748,11 @@ comments: true nums = new int[numsCapacity]; } + /* 析构函数 */ + ~MyList() { + delete[] nums; + } + /* 获取列表长度（即当前元素数量）*/ int size() { return numsSize; @@ -818,14 +823,14 @@ comments: true void extendCapacity() { // 新建一个长度为 size * extendRatio 的数组，并将原数组拷贝到新数组 int newCapacity = capacity() * extendRatio; - int* extend = new int[newCapacity]; + int* tmp = nums; + nums = new int[newCapacity]; // 将原数组中的所有元素复制到新数组 for (int i = 0; i < size(); i++) { - extend[i] = nums[i]; + nums[i] = tmp[i]; } - int* temp = nums; - nums = extend; - delete[] temp; + // 释放内存 + delete[] tmp; numsCapacity = newCapacity; } }; diff --git a/docs/chapter_computational_complexity/space_complexity.md b/docs/chapter_computational_complexity/space_complexity.md index e594bec8..96873fc1 100644 --- a/docs/chapter_computational_complexity/space_complexity.md +++ b/docs/chapter_computational_complexity/space_complexity.md @@ -507,7 +507,7 @@ $$ const int a = 0; int b = 0; vector nums(10000); - ListNode* node = new ListNode(0); + ListNode node(0); // 循环中的变量占用 O(1) 空间 for (int i = 0; i < n; i++) { int c = 0; @@ -654,9 +654,9 @@ $$ // 长度为 n 的数组占用 O(n) 空间 vector nums(n); // 长度为 n 的列表占用 O(n) 空间 - vector nodes; + vector nodes; for (int i = 0; i < n; i++) { - nodes.push_back(new ListNode(i)); + nodes.push_back(ListNode(i)); } // 长度为 n 的哈希表占用 O(n) 空间 unordered_map map; diff --git a/docs/chapter_computational_complexity/time_complexity.md b/docs/chapter_computational_complexity/time_complexity.md index 92f5a519..def052c9 100644 --- a/docs/chapter_computational_complexity/time_complexity.md +++ b/docs/chapter_computational_complexity/time_complexity.md @@ -355,8 +355,8 @@ $$ print(0) } } - ``` + ![time_complexity_first_example](time_complexity.assets/time_complexity_first_example.png)

Fig. 算法 A, B, C 的时间增长趋势

@@ -725,7 +725,6 @@ $$ } ``` - ### 2. 判断渐近上界 **时间复杂度由多项式 $T(n)$ 中最高阶的项来决定**。这是因为在 $n$ 趋于无穷大时，最高阶的项将处于主导作用，其它项的影响都可以被忽略。 @@ -1435,11 +1434,14 @@ $$ for (int i = n - 1; i > 0; i--) { // 内循环：冒泡操作 for (int j = 0; j < i; j++) { - // 交换 nums[j] 与 nums[j + 1] - int tmp = nums[j]; - nums[j] = nums[j + 1]; - nums[j + 1] = tmp; - count += 3; // 元素交换包含 3 个单元操作 + if (nums[j] > nums [j + 1]) + { + // 交换 nums[j] 与 nums[j + 1] + int tmp = nums[j]; + nums[j] = nums[j + 1]; + nums[j + 1] = tmp; + count += 3; // 元素交换包含 3 个单元操作 + } } } diff --git a/docs/chapter_heap/heap.assets/heap_poll_step1.png b/docs/chapter_heap/heap.assets/heap_poll_step1.png new file mode 100644 index 00000000..f1a8d905 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step1.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step10.png b/docs/chapter_heap/heap.assets/heap_poll_step10.png new file mode 100644 index 00000000..027c7e18 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step10.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step2.png b/docs/chapter_heap/heap.assets/heap_poll_step2.png new file mode 100644 index 00000000..abef7ca8 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step2.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step3.png b/docs/chapter_heap/heap.assets/heap_poll_step3.png new file mode 100644 index 00000000..4a2db29a Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step3.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step4.png b/docs/chapter_heap/heap.assets/heap_poll_step4.png new file mode 100644 index 00000000..64c4fd42 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step4.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step5.png b/docs/chapter_heap/heap.assets/heap_poll_step5.png new file mode 100644 index 00000000..513d6fe8 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step5.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step6.png b/docs/chapter_heap/heap.assets/heap_poll_step6.png new file mode 100644 index 00000000..72f3ffac Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step6.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step7.png b/docs/chapter_heap/heap.assets/heap_poll_step7.png new file mode 100644 index 00000000..85263d5a Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step7.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step8.png b/docs/chapter_heap/heap.assets/heap_poll_step8.png new file mode 100644 index 00000000..9231963d Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step8.png differ diff --git a/docs/chapter_heap/heap.assets/heap_poll_step9.png b/docs/chapter_heap/heap.assets/heap_poll_step9.png new file mode 100644 index 00000000..34b578f2 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_poll_step9.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step1.png b/docs/chapter_heap/heap.assets/heap_push_step1.png new file mode 100644 index 00000000..00489b07 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step1.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step2.png b/docs/chapter_heap/heap.assets/heap_push_step2.png new file mode 100644 index 00000000..a38eef32 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step2.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step3.png b/docs/chapter_heap/heap.assets/heap_push_step3.png new file mode 100644 index 00000000..01491207 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step3.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step4.png b/docs/chapter_heap/heap.assets/heap_push_step4.png new file mode 100644 index 00000000..4379a31c Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step4.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step5.png b/docs/chapter_heap/heap.assets/heap_push_step5.png new file mode 100644 index 00000000..e810842e Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step5.png differ diff --git a/docs/chapter_heap/heap.assets/heap_push_step6.png b/docs/chapter_heap/heap.assets/heap_push_step6.png new file mode 100644 index 00000000..66ea466a Binary files /dev/null and b/docs/chapter_heap/heap.assets/heap_push_step6.png differ diff --git a/docs/chapter_heap/heap.assets/heapify_count.png b/docs/chapter_heap/heap.assets/heapify_count.png new file mode 100644 index 00000000..944aab54 Binary files /dev/null and b/docs/chapter_heap/heap.assets/heapify_count.png differ diff --git a/docs/chapter_heap/heap.assets/min_heap_and_max_heap.png b/docs/chapter_heap/heap.assets/min_heap_and_max_heap.png new file mode 100644 index 00000000..fe1720d9 Binary files /dev/null and b/docs/chapter_heap/heap.assets/min_heap_and_max_heap.png differ diff --git a/docs/chapter_heap/heap.assets/representation_of_heap.png b/docs/chapter_heap/heap.assets/representation_of_heap.png new file mode 100644 index 00000000..5a9cac20 Binary files /dev/null and b/docs/chapter_heap/heap.assets/representation_of_heap.png differ diff --git a/docs/chapter_heap/heap.md b/docs/chapter_heap/heap.md new file mode 100644 index 00000000..15d22e78 --- /dev/null +++ b/docs/chapter_heap/heap.md @@ -0,0 +1,798 @@ +--- +comments: true +--- + +# 堆 + +「堆 Heap」是一颗限定条件下的「完全二叉树」。根据成立条件，堆主要分为两种类型： + +- 「大顶堆 Max Heap」，任意结点的值 $\geq$ 其子结点的值； +- 「小顶堆 Min Heap」，任意结点的值 $\leq$ 其子结点的值； + +![min_heap_and_max_heap](heap.assets/min_heap_and_max_heap.png) + +## 堆术语与性质 + +- 由于堆是完全二叉树，因此最底层结点靠左填充，其它层结点皆被填满。 +- 二叉树中的根结点对应「堆顶」，底层最靠右结点对应「堆底」。 +- 对于大顶堆 / 小顶堆，其堆顶元素（即根结点）的值最大 / 最小。 + +## 堆常用操作 + +值得说明的是，多数编程语言提供的是「优先队列 Priority Queue」，其是一种抽象数据结构，**定义为具有出队优先级的队列**。 + +而恰好，**堆的定义与优先队列的操作逻辑完全吻合**，大顶堆就是一个元素从大到小出队的优先队列。从使用角度看，我们可以将「优先队列」和「堆」理解为等价的数据结构。因此，本文与代码对两者不做特别区分，统一使用「堆」来命名。 + +堆的常用操作见下表（方法命名以 Java 为例）。 + +

Table. 堆的常用操作

+ +
+ +| 方法 | 描述 | 时间复杂度 | +| --------- | -------------------------------------------- | ----------- | +| add() | 元素入堆 | $O(\log n)$ | +| poll() | 堆顶元素出堆 | $O(\log n)$ | +| peek() | 访问堆顶元素（大 / 小顶堆分别为最大 / 小值） | $O(1)$ | +| size() | 获取堆的元素数量 | $O(1)$ | +| isEmpty() | 判断堆是否为空 | $O(1)$ | + +
+ +我们可以直接使用编程语言提供的堆类（或优先队列类）。 + +!!! tip + + 类似于排序中“从小到大排列”和“从大到小排列”，“大顶堆”和“小顶堆”可仅通过修改 Comparator 来互相转换。 + +=== "Java" + + ```java title="heap.java" + /* 初始化堆 */ + // 初始化小顶堆 + Queue minHeap = new PriorityQueue<>(); + // 初始化大顶堆（使用 lambda 表达式修改 Comparator 即可） + Queue maxHeap = new PriorityQueue<>((a, b) -> { return b - a; }); + + /* 元素入堆 */ + maxHeap.add(1); + maxHeap.add(3); + maxHeap.add(2); + maxHeap.add(5); + maxHeap.add(4); + + /* 获取堆顶元素 */ + int peek = maxHeap.peek(); // 5 + + /* 堆顶元素出堆 */ + // 出堆元素会形成一个从大到小的序列 + peek = heap.poll(); // 5 + peek = heap.poll(); // 4 + peek = heap.poll(); // 3 + peek = heap.poll(); // 2 + peek = heap.poll(); // 1 + + /* 获取堆大小 */ + int size = maxHeap.size(); + + /* 判断堆是否为空 */ + boolean isEmpty = maxHeap.isEmpty(); + + /* 输入列表并建堆 */ + minHeap = new PriorityQueue<>(Arrays.asList(1, 3, 2, 5, 4)); + ``` + +=== "C++" + + ```cpp title="heap.cpp" + + ``` + +=== "Python" + + ```python title="heap.py" + + ``` + +=== "Go" + + ```go title="heap.go" + // Go 语言中可以通过实现 heap.Interface 来构建整数大顶堆 + // 实现 heap.Interface 需要同时实现 sort.Interface + type intHeap []any + + // Push heap.Interface 的方法，实现推入元素到堆 + func (h *intHeap) Push(x any) { + // Push 和 Pop 使用 pointer receiver 作为参数 + // 因为它们不仅会对切片的内容进行调整，还会修改切片的长度。 + *h = append(*h, x.(int)) + } + + // Pop heap.Interface 的方法，实现弹出堆顶元素 + func (h *intHeap) Pop() any { + // 待出堆元素存放在最后 + last := (*h)[len(*h)-1] + *h = (*h)[:len(*h)-1] + return last + } + + // Len sort.Interface 的方法 + func (h *intHeap) Len() int { + return len(*h) + } + + // Less sort.Interface 的方法 + func (h *intHeap) Less(i, j int) bool { + // 如果实现小顶堆，则需要调整为小于号 + return (*h)[i].(int) > (*h)[j].(int) + } + + // Swap sort.Interface 的方法 + func (h *intHeap) Swap(i, j int) { + (*h)[i], (*h)[j] = (*h)[j], (*h)[i] + } + + // Top 获取堆顶元素 + func (h *intHeap) Top() any { + return (*h)[0] + } + + /* Driver Code */ + func TestHeap(t *testing.T) { + /* 初始化堆 */ + // 初始化大顶堆 + maxHeap := &intHeap{} + heap.Init(maxHeap) + /* 元素入堆 */ + // 调用 heap.Interface 的方法，来添加元素 + heap.Push(maxHeap, 1) + heap.Push(maxHeap, 3) + heap.Push(maxHeap, 2) + heap.Push(maxHeap, 4) + heap.Push(maxHeap, 5) + + /* 获取堆顶元素 */ + top := maxHeap.Top() + fmt.Printf("堆顶元素为 %d\n", top) + + /* 堆顶元素出堆 */ + // 调用 heap.Interface 的方法，来移除元素 + heap.Pop(maxHeap) + heap.Pop(maxHeap) + heap.Pop(maxHeap) + heap.Pop(maxHeap) + heap.Pop(maxHeap) + + /* 获取堆大小 */ + size := len(*maxHeap) + fmt.Printf("堆元素数量为 %d\n", size) + + /* 判断堆是否为空 */ + isEmpty := len(*maxHeap) == 0 + fmt.Printf("堆是否为空 %t\n", isEmpty) + } + ``` + +=== "JavaScript" + + ```js title="heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="heap.ts" + + ``` + +=== "C" + + ```c title="heap.c" + + ``` + +=== "C#" + + ```csharp title="heap.cs" + + ``` + +=== "Swift" + + ```swift title="heap.swift" + + ``` + +## 堆的实现 + +下文实现的是「大顶堆」，若想转换为「小顶堆」，将所有大小逻辑判断取逆（例如将 $\geq$ 替换为 $\leq$ ）即可，有兴趣的同学可自行实现。 + +### 堆的存储与表示 + +在二叉树章节我们学过，「完全二叉树」非常适合使用「数组」来表示，而堆恰好是一颗完全二叉树，**因而我们采用「数组」来存储「堆」**。 + +**二叉树指针**。使用数组表示二叉树时，元素代表结点值，索引代表结点在二叉树中的位置，**而结点指针通过索引映射公式来实现**。 + +具体地，给定索引 $i$ ，那么其左子结点索引为 $2i + 1$ 、右子结点索引为 $2i + 2$ 、父结点索引为 $(i - 1) / 2$ （向下整除）。当索引越界时，代表空结点或结点不存在。 + +![representation_of_heap](heap.assets/representation_of_heap.png) + +我们将索引映射公式封装成函数，以便后续使用。 + +=== "Java" + + ```java title="my_heap.java" + // 使用列表而非数组，这样无需考虑扩容问题 + List maxHeap; + + /* 构造函数，建立空堆 */ + public MaxHeap() { + maxHeap = new ArrayList<>(); + } + + /* 获取左子结点索引 */ + int left(int i) { + return 2 * i + 1; + } + + /* 获取右子结点索引 */ + int right(int i) { + return 2 * i + 2; + } + + /* 获取父结点索引 */ + int parent(int i) { + return (i - 1) / 2; // 向下整除 + } + ``` + +=== "C++" + + ```cpp title="my_heap.cpp" + + ``` + +=== "Python" + + ```python title="my_heap.py" + + ``` + +=== "Go" + + ```go title="my_heap.go" + type maxHeap struct { + // 使用切片而非数组，这样无需考虑扩容问题 + data []any + } + + /* 构造函数，建立空堆 */ + func newHeap() *maxHeap { + return &maxHeap{ + data: make([]any, 0), + } + } + + /* 获取左子结点索引 */ + func (h *maxHeap) left(i int) int { + return 2*i + 1 + } + + /* 获取右子结点索引 */ + func (h *maxHeap) right(i int) int { + return 2*i + 2 + } + + /* 获取父结点索引 */ + func (h *maxHeap) parent(i int) int { + // 向下整除 + return (i - 1) / 2 + } + ``` + +=== "JavaScript" + + ```js title="my_heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="my_heap.ts" + + ``` + +=== "C" + + ```c title="my_heap.c" + + ``` + +=== "C#" + + ```csharp title="my_heap.cs" + + ``` + +=== "Swift" + + ```swift title="my_heap.swift" + + ``` + +### 访问堆顶元素 + +堆顶元素是二叉树的根结点，即列表首元素。 + +=== "Java" + + ```java title="my_heap.java" + /* 访问堆顶元素 */ + public int peek() { + return maxHeap.get(0); + } + ``` + +=== "C++" + + ```cpp title="my_heap.cpp" + + ``` + +=== "Python" + + ```python title="my_heap.py" + + ``` + +=== "Go" + + ```go title="my_heap.go" + /* 访问堆顶元素 */ + func (h *maxHeap) peek() any { + return h.data[0] + } + ``` + +=== "JavaScript" + + ```js title="my_heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="my_heap.ts" + + ``` + +=== "C" + + ```c title="my_heap.c" + + ``` + +=== "C#" + + ```csharp title="my_heap.cs" + + ``` + +=== "Swift" + + ```swift title="my_heap.swift" + + ``` + +### 元素入堆 + +给定元素 `val` ，我们先将其添加到堆底。添加后，由于 `val` 可能大于堆中其它元素，此时堆的成立条件可能已经被破坏，**因此需要修复从插入结点到根结点这条路径上的各个结点**，该操作被称为「堆化 Heapify」。 + +考虑从入堆结点开始，**从底至顶执行堆化**。具体地，比较插入结点与其父结点的值，若插入结点更大则将它们交换；并循环以上操作，从底至顶地修复堆中的各个结点；直至越过根结点时结束，或当遇到无需交换的结点时提前结束。 + +=== "Step 1" + ![heap_push_step1](heap.assets/heap_push_step1.png) + +=== "Step 2" + ![heap_push_step2](heap.assets/heap_push_step2.png) + +=== "Step 3" + ![heap_push_step3](heap.assets/heap_push_step3.png) + +=== "Step 4" + ![heap_push_step4](heap.assets/heap_push_step4.png) + +=== "Step 5" + ![heap_push_step5](heap.assets/heap_push_step5.png) + +=== "Step 6" + ![heap_push_step6](heap.assets/heap_push_step6.png) + +设结点总数为 $n$ ，则树的高度为 $O(\log n)$ ，易得堆化操作的循环轮数最多为 $O(\log n)$ ，**因而元素入堆操作的时间复杂度为 $O(\log n)$** 。 + +=== "Java" + + ```java title="my_heap.java" + /* 元素入堆 */ + void push(int val) { + // 添加结点 + maxHeap.add(val); + // 从底至顶堆化 + siftUp(size() - 1); + } + + /* 从结点 i 开始，从底至顶堆化 */ + void siftUp(int i) { + while (true) { + // 获取结点 i 的父结点 + int p = parent(i); + // 若“越过根结点”或“结点无需修复”，则结束堆化 + if (p < 0 || maxHeap.get(i) <= maxHeap.get(p)) + break; + // 交换两结点 + swap(i, p); + // 循环向上堆化 + i = p; + } + } + ``` + +=== "C++" + + ```cpp title="my_heap.cpp" + + ``` + +=== "Python" + + ```python title="my_heap.py" + + ``` + +=== "Go" + + ```go title="my_heap.go" + /* 元素入堆 */ + func (h *maxHeap) push(val any) { + // 添加结点 + h.data = append(h.data, val) + // 从底至顶堆化 + h.siftUp(len(h.data) - 1) + } + + /* 从结点 i 开始，从底至顶堆化 */ + func (h *maxHeap) siftUp(i int) { + for true { + // 获取结点 i 的父结点 + p := h.parent(i) + // 当“越过根结点”或“结点无需修复”时，结束堆化 + if p < 0 || h.data[i].(int) <= h.data[p].(int) { + break + } + // 交换两结点 + h.swap(i, p) + // 循环向上堆化 + i = p + } + } + ``` + +=== "JavaScript" + + ```js title="my_heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="my_heap.ts" + + ``` + +=== "C" + + ```c title="my_heap.c" + + ``` + +=== "C#" + + ```csharp title="my_heap.cs" + + ``` + +=== "Swift" + + ```swift title="my_heap.swift" + + ``` + +### 堆顶元素出堆 + +堆顶元素是二叉树根结点，即列表首元素，如果我们直接将首元素从列表中删除，则二叉树中所有结点都会随之发生移位（索引发生变化），这样后续使用堆化修复就很麻烦了。为了尽量减少元素索引变动，采取以下操作步骤： + +1. 交换堆顶元素与堆底元素（即交换根结点与最右叶结点）； +2. 交换完成后，将堆底从列表中删除（注意，因为已经交换，实际上删除的是原来的堆顶元素）； +3. 从根结点开始，**从顶至底执行堆化**； + +顾名思义，**从顶至底堆化的操作方向与从底至顶堆化相反**，我们比较根结点的值与其两个子结点的值，将最大的子结点与根结点执行交换，并循环以上操作，直到越过叶结点时结束，或当遇到无需交换的结点时提前结束。 + +=== "Step 1" + ![heap_poll_step1](heap.assets/heap_poll_step1.png) + +=== "Step 2" + ![heap_poll_step2](heap.assets/heap_poll_step2.png) + +=== "Step 3" + ![heap_poll_step3](heap.assets/heap_poll_step3.png) + +=== "Step 4" + ![heap_poll_step4](heap.assets/heap_poll_step4.png) + +=== "Step 5" + ![heap_poll_step5](heap.assets/heap_poll_step5.png) + +=== "Step 6" + ![heap_poll_step6](heap.assets/heap_poll_step6.png) + +=== "Step 7" + ![heap_poll_step7](heap.assets/heap_poll_step7.png) + +=== "Step 8" + ![heap_poll_step8](heap.assets/heap_poll_step8.png) + +=== "Step 9" + ![heap_poll_step9](heap.assets/heap_poll_step9.png) + +=== "Step 10" + ![heap_poll_step10](heap.assets/heap_poll_step10.png) + +与元素入堆操作类似，**堆顶元素出堆操作的时间复杂度为 $O(\log n)$** 。 + +=== "Java" + + ```java title="my_heap.java" + /* 元素出堆 */ + int poll() { + // 判空处理 + if (isEmpty()) + throw new EmptyStackException(); + // 交换根结点与最右叶结点（即交换首元素与尾元素） + swap(0, size() - 1); + // 删除结点 + int val = maxHeap.remove(size() - 1); + // 从顶至底堆化 + siftDown(0); + // 返回堆顶元素 + return val; + } + + /* 从结点 i 开始，从顶至底堆化 */ + void siftDown(int i) { + while (true) { + // 判断结点 i, l, r 中值最大的结点，记为 ma + int l = left(i), r = right(i), ma = i; + if (l < size() && maxHeap.get(l) > maxHeap.get(ma)) + ma = l; + if (r < size() && maxHeap.get(r) > maxHeap.get(ma)) + ma = r; + // 若“结点 i 最大”或“越过叶结点”，则结束堆化 + if (ma == i) break; + // 交换两结点 + swap(i, ma); + // 循环向下堆化 + i = ma; + } + } + ``` + +=== "C++" + + ```cpp title="my_heap.cpp" + + ``` + +=== "Python" + + ```python title="my_heap.py" + + ``` + +=== "Go" + + ```go title="my_heap.go" + /* 元素出堆 */ + func (h *maxHeap) poll() any { + // 判空处理 + if h.isEmpty() { + fmt.Println("error") + } + // 交换根结点与最右叶结点（即交换首元素与尾元素） + h.swap(0, h.size()-1) + // 删除结点 + val := h.data[len(h.data)-1] + h.data = h.data[:len(h.data)-1] + // 从顶至底堆化 + h.siftDown(0) + + // 返回堆顶元素 + return val + } + + /* 从结点 i 开始，从顶至底堆化 */ + func (h *maxHeap) siftDown(i int) { + for true { + // 判断结点 i, l, r 中值最大的结点，记为 max + l, r, max := h.left(i), h.right(i), i + if l < h.size() && h.data[l].(int) > h.data[max].(int) { + max = l + } + if r < h.size() && h.data[r].(int) > h.data[max].(int) { + max = r + } + // 若结点 i 最大或索引 l, r 越界，则无需继续堆化，跳出 + if max == i { + break + } + // 交换两结点 + h.swap(i, max) + // 循环向下堆化 + i = max + } + } + ``` + +=== "JavaScript" + + ```js title="my_heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="my_heap.ts" + + ``` + +=== "C" + + ```c title="my_heap.c" + + ``` + +=== "C#" + + ```csharp title="my_heap.cs" + + ``` + +=== "Swift" + + ```swift title="my_heap.swift" + + ``` + +### 输入数据并建堆 * + +如果我们想要直接输入一个列表并将其建堆，那么该怎么做呢？最直接地，考虑使用「元素入堆」方法，将列表元素依次入堆。元素入堆的时间复杂度为 $O(n)$ ，而平均长度为 $\frac{n}{2}$ ，因此该方法的总体时间复杂度为 $O(n \log n)$ 。 + +然而，存在一种更加优雅的建堆方法。设结点数量为 $n$ ，我们先将列表所有元素原封不动添加进堆，**然后迭代地对各个结点执行「从顶至底堆化」**。当然，**无需对叶结点执行堆化**，因为其没有子结点。 + +=== "Java" + + ```java title="my_heap.java" + /* 构造函数，根据输入列表建堆 */ + public MaxHeap(List nums) { + // 将列表元素原封不动添加进堆 + maxHeap = new ArrayList<>(nums); + // 堆化除叶结点以外的其他所有结点 + for (int i = parent(size() - 1); i >= 0; i--) { + siftDown(i); + } + } + ``` + +=== "C++" + + ```cpp title="my_heap.cpp" + + ``` + +=== "Python" + + ```python title="my_heap.py" + + ``` + +=== "Go" + + ```go title="my_heap.go" + /* 构造函数，根据切片建堆 */ + func newMaxHeap(nums []any) *maxHeap { + // 所有元素入堆 + h := &maxHeap{data: nums} + for i := len(h.data) - 1; i >= 0; i-- { + // 堆化除叶结点以外的其他所有结点 + h.siftDown(i) + } + return h + } + ``` + +=== "JavaScript" + + ```js title="my_heap.js" + + ``` + +=== "TypeScript" + + ```typescript title="my_heap.ts" + + ``` + +=== "C" + + ```c title="my_heap.c" + + ``` + +=== "C#" + + ```csharp title="my_heap.cs" + + ``` + +=== "Swift" + + ```swift title="my_heap.swift" + + ``` + +那么，第二种建堆方法的时间复杂度时多少呢？我们来做一下简单推算。 + +- 完全二叉树中，设结点总数为 $n$ ，则叶结点数量为 $(n + 1) / 2$ ，其中 $/$ 为向下整除。因此在排除叶结点后，需要堆化结点数量为 $(n - 1)/2$ ，即为 $O(n)$ ； +- 从顶至底堆化中，每个结点最多堆化至叶结点，因此最大迭代次数为二叉树高度 $O(\log n)$ ； + +将上述两者相乘，可得时间复杂度为 $O(n \log n)$ 。然而，该估算结果仍不够准确，因为我们没有考虑到 **二叉树底层结点远多于顶层结点** 的性质。 + +下面我们来尝试展开计算。为了减小计算难度，我们假设树是一个「完美二叉树」，该假设不会影响计算结果的正确性。设二叉树（即堆）结点数量为 $n$ ，树高度为 $h$ 。上文提到，**结点堆化最大迭代次数等于该结点到叶结点的距离，而这正是“结点高度”**。因此，我们将各层的“结点数量 $\times$ 结点高度”求和，即可得到所有结点的堆化的迭代次数总和。 + +$$ +T(h) = 2^0h + 2^1(h-1) + 2^2(h-2) + \cdots + 2^{(h-1)}\times1 +$$ + +![heapify_count](heap.assets/heapify_count.png) + +化简上式需要借助中学的数列知识，先对 $T(h)$ 乘以 $2$ ，易得 + +$$ +\begin{aligned} +T(h) & = 2^0h + 2^1(h-1) + 2^2(h-2) + \cdots + 2^{h-1}\times1 \newline +2 T(h) & = 2^1h + 2^2(h-1) + 2^3(h-2) + \cdots + 2^{h}\times1 \newline +\end{aligned} +$$ + +**使用错位相减法**，令下式 $2 T(h)$ 减去上式 $T(h)$ ，可得 + +$$ +2T(h) - T(h) = T(h) = -2^0h + 2^1 + 2^2 + \cdots + 2^{h-1} + 2^h +$$ + +观察上式，$T(h)$ 是一个等比数列，可直接使用求和公式，得到时间复杂度为 + +$$ +\begin{aligned} +T(h) & = 2 \frac{1 - 2^h}{1 - 2} - h \newline +& = 2^{h+1} - h \newline +& = O(2^h) +\end{aligned} +$$ + +进一步地，高度为 $h$ 的完美二叉树的结点数量为 $n = 2^{h+1} - 1$ ，易得复杂度为 $O(2^h) = O(n)$。以上推算表明，**输入列表并建堆的时间复杂度为 $O(n)$ ，非常高效**。 + +## 堆常见应用 + +- **优先队列**。堆常作为实现优先队列的首选数据结构，入队和出队操作时间复杂度为 $O(\log n)$ ，建队操作为 $O(n)$ ，皆非常高效。 +- **堆排序**。给定一组数据，我们使用其建堆，并依次全部弹出，则可以得到有序的序列。当然，堆排序一般无需弹出元素，仅需每轮将堆顶元素交换至数组尾部并减小堆的长度即可。 +- **获取最大的 $k$ 个元素**。这既是一道经典算法题目，也是一种常见应用，例如选取热度前 10 的新闻作为微博热搜，选取前 10 销量的商品等。 diff --git a/docs/chapter_introduction/what_is_dsa.md b/docs/chapter_introduction/what_is_dsa.md index 67b3c37e..10ea2513 100644 --- a/docs/chapter_introduction/what_is_dsa.md +++ b/docs/chapter_introduction/what_is_dsa.md @@ -6,7 +6,7 @@ comments: true ## 算法定义 -「算法 Algorithm」是在有限时间内解决问题的一组指令或操作步骤。算法具有以下特性： +「算法 Algorithm」是在有限时间内解决特定问题的一组指令或操作步骤。算法具有以下特性： - 问题是明确的，需要拥有明确的输入和输出定义。 - 解具有确定性，即给定相同输入时，输出一定相同。 diff --git a/docs/chapter_preface/contribution.md b/docs/chapter_preface/contribution.md index c710e6de..498002c7 100644 --- a/docs/chapter_preface/contribution.md +++ b/docs/chapter_preface/contribution.md @@ -41,4 +41,25 @@ comments: true 非常欢迎您和我一同来创作本书！ +## 本地部署 hello-algo + +### Docker + +请确保 Docker 已经安装并启动，并根据如下命令离线部署。 + +稍等片刻，即可使用浏览器打开 `http://localhost:8000` 访问本项目。 + +```bash +git clone https://github.com/krahets/hello-algo.git +cd hello-algo + +docker-compose up -d +``` + +使用如下命令即可删除部署。 + +```bash +docker-compose down +``` + （TODO：教学视频） diff --git a/docs/chapter_preface/installation.md b/docs/chapter_preface/installation.md index c6c1b2ee..e23608a6 100644 --- a/docs/chapter_preface/installation.md +++ b/docs/chapter_preface/installation.md @@ -15,10 +15,9 @@ comments: true 1. 下载并安装 [OpenJDK](https://jdk.java.net/18/)（版本需满足 > JDK 9）。 2. 在 VSCode 的插件市场中搜索 `java` ，安装 Java Extension Pack 。 +## C/C++ 环境 -## C++ 环境 - -1. Windows 系统需要安装 [MinGW](https://www.mingw-w64.org/downloads/) ，MacOS 自带 Clang 无需安装。 +1. Windows 系统需要安装 [MinGW](https://sourceforge.net/projects/mingw-w64/files/) （[完整配置教程](https://zhuanlan.zhihu.com/p/77074009)），MacOS 自带 Clang 无需安装。 2. 在 VSCode 的插件市场中搜索 `c++` ，安装 C/C++ Extension Pack 。 ## Python 环境 @@ -46,3 +45,8 @@ comments: true 1. 下载并安装 [Swift](https://www.swift.org/download/)； 2. 在 VSCode 的插件市场中搜索 `swift`，安装 [Swift for Visual Studio Code](https://marketplace.visualstudio.com/items?itemName=sswg.swift-lang)。 + +## Rust 环境 + +1. 下载并安装 [Rust](https://www.rust-lang.org/tools/install)； +2. 在 VSCode 的插件市场中搜索 `rust`，安装 [rust-analyzer](https://marketplace.visualstudio.com/items?itemName=rust-lang.rust-analyzer)。 diff --git a/docs/chapter_searching/binary_search.md b/docs/chapter_searching/binary_search.md index 2bd2d439..da60b3b4 100644 --- a/docs/chapter_searching/binary_search.md +++ b/docs/chapter_searching/binary_search.md @@ -141,20 +141,20 @@ $$ ```js title="binary_search.js" /* 二分查找（双闭区间） */ function binarySearch(nums, target) { - // 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素 - let i = 0, j = nums.length - 1; - // 循环，当搜索区间为空时跳出（当 i > j 时为空） - while (i <= j) { - let m = parseInt((i + j) / 2); // 计算中点索引 m ，在 JS 中需使用 parseInt 函数取整 - if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中 - i = m + 1; - else if (nums[m] > target) // 此情况说明 target 在区间 [i, m-1] 中 - j = m - 1; - else - return m; // 找到目标元素，返回其索引 + // 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素 + let i = 0, j = nums.length - 1; + // 循环，当搜索区间为空时跳出（当 i > j 时为空） + while (i <= j) { + let m = parseInt((i + j) / 2); // 计算中点索引 m ，在 JS 中需使用 parseInt 函数取整 + if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中 + i = m + 1; + else if (nums[m] > target) // 此情况说明 target 在区间 [i, m-1] 中 + j = m - 1; + else + return m; // 找到目标元素，返回其索引 } - // 未找到目标元素，返回 -1 - return -1; + // 未找到目标元素，返回 -1 + return -1; } ``` @@ -311,20 +311,20 @@ $$ ```js title="binary_search.js" /* 二分查找（左闭右开） */ function binarySearch1(nums, target) { - // 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1 - let i = 0, j = nums.length; - // 循环，当搜索区间为空时跳出（当 i = j 时为空） - while (i < j) { - let m = parseInt((i + j) / 2); // 计算中点索引 m ，在 JS 中需使用 parseInt 函数取整 - if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中 - i = m + 1; - else if (nums[m] > target) // 此情况说明 target 在区间 [i, m] 中 - j = m; - else // 找到目标元素，返回其索引 - return m; + // 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1 + let i = 0, j = nums.length; + // 循环，当搜索区间为空时跳出（当 i = j 时为空） + while (i < j) { + let m = parseInt((i + j) / 2); // 计算中点索引 m ，在 JS 中需使用 parseInt 函数取整 + if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中 + i = m + 1; + else if (nums[m] > target) // 此情况说明 target 在区间 [i, m] 中 + j = m; + else // 找到目标元素，返回其索引 + return m; } - // 未找到目标元素，返回 -1 - return -1; + // 未找到目标元素，返回 -1 + return -1; } ``` diff --git a/docs/chapter_searching/hashing_search.md b/docs/chapter_searching/hashing_search.md index 07645730..9f3d74c0 100644 --- a/docs/chapter_searching/hashing_search.md +++ b/docs/chapter_searching/hashing_search.md @@ -68,13 +68,23 @@ comments: true === "JavaScript" ```js title="hashing_search.js" - + /* 哈希查找（数组） */ + function hashingSearch(map, target) { + // 哈希表的 key: 目标元素，value: 索引 + // 若哈希表中无此 key ，返回 -1 + return map.has(target) ? map.get(target) : -1; + } ``` === "TypeScript" ```typescript title="hashing_search.ts" - + /* 哈希查找（数组） */ + function hashingSearch(map: Map, target: number): number { + // 哈希表的 key: 目标元素，value: 索引 + // 若哈希表中无此 key ，返回 -1 + return map.has(target) ? map.get(target) as number : -1; + } ``` === "C" @@ -151,19 +161,29 @@ comments: true } else { return nil } - } + } ``` === "JavaScript" ```js title="hashing_search.js" - + /* 哈希查找（链表） */ + function hashingSearch1(map, target) { + // 哈希表的 key: 目标结点值，value: 结点对象 + // 若哈希表中无此 key ，返回 null + return map.has(target) ? map.get(target) : null; + } ``` === "TypeScript" ```typescript title="hashing_search.ts" - + /* 哈希查找（链表） */ + function hashingSearch1(map: Map, target: number): ListNode | null { + // 哈希表的 key: 目标结点值，value: 结点对象 + // 若哈希表中无此 key ，返回 null + return map.has(target) ? map.get(target) as ListNode : null; + } ``` === "C" diff --git a/docs/chapter_searching/linear_search.md b/docs/chapter_searching/linear_search.md index d9371ab2..a42ccc36 100644 --- a/docs/chapter_searching/linear_search.md +++ b/docs/chapter_searching/linear_search.md @@ -94,7 +94,18 @@ comments: true === "TypeScript" ```typescript title="linear_search.ts" - + /* 线性查找（数组）*/ + function linearSearchArray(nums: number[], target: number): number { + // 遍历数组 + for (let i = 0; i < nums.length; i++) { + // 找到目标元素，返回其索引 + if (nums[i] === target) { + return i; + } + } + // 未找到目标元素，返回 -1 + return -1; + } ``` === "C" @@ -216,7 +227,19 @@ comments: true === "TypeScript" ```typescript title="linear_search.ts" - + /* 线性查找（链表）*/ + function linearSearchLinkedList(head: ListNode | null, target: number): ListNode | null { + // 遍历链表 + while (head) { + // 找到目标结点，返回之 + if (head.val === target) { + return head; + } + head = head.next; + } + // 未找到目标结点，返回 null + return null; + } ``` === "C" diff --git a/docs/chapter_sorting/bubble_sort.md b/docs/chapter_sorting/bubble_sort.md index e3e394b2..3bb0bc99 100644 --- a/docs/chapter_sorting/bubble_sort.md +++ b/docs/chapter_sorting/bubble_sort.md @@ -170,7 +170,7 @@ comments: true ```c title="bubble_sort.c" /* 冒泡排序 */ - void bubble_sort(int nums[], int size) { + void bubbleSort(int nums[], int size) { // 外循环：待排序元素数量为 n-1, n-2, ..., 1 for (int i = 0; i < size - 1; i++) { @@ -373,7 +373,7 @@ comments: true ```c title="bubble_sort.c" /* 冒泡排序 */ - void bubble_sort(int nums[], int size) { + void bubbleSortWithFlag(int nums[], int size) { // 外循环：待排序元素数量为 n-1, n-2, ..., 1 for (int i = 0; i < size - 1; i++) { diff --git a/docs/chapter_sorting/quick_sort.md b/docs/chapter_sorting/quick_sort.md index a712a1bf..62ab2147 100644 --- a/docs/chapter_sorting/quick_sort.md +++ b/docs/chapter_sorting/quick_sort.md @@ -134,27 +134,27 @@ comments: true ``` js title="quick_sort.js" /* 元素交换 */ function swap(nums, i, j) { - let tmp = nums[i] - nums[i] = nums[j] - nums[j] = tmp + let tmp = nums[i]; + nums[i] = nums[j]; + nums[j] = tmp; } /* 哨兵划分 */ - function partition(nums, left, right){ + function partition(nums, left, right) { // 以 nums[left] 作为基准数 - let i = left, j = right - while(i < j){ - while(i < j && nums[j] >= nums[left]){ - j -= 1 // 从右向左找首个小于基准数的元素 + let i = left, j = right; + while (i < j) { + while (i < j && nums[j] >= nums[left]) { + j -= 1; // 从右向左找首个小于基准数的元素 } - while(i < j && nums[i] <= nums[left]){ - i += 1 // 从左向右找首个大于基准数的元素 + while (i < j && nums[i] <= nums[left]) { + i += 1; // 从左向右找首个大于基准数的元素 } // 元素交换 - swap(nums, i, j) // 交换这两个元素 + swap(nums, i, j); // 交换这两个元素 } - swap(nums, i, left) // 将基准数交换至两子数组的分界线 - return i // 返回基准数的索引 + swap(nums, i, left); // 将基准数交换至两子数组的分界线 + return i; // 返回基准数的索引 } ``` @@ -313,14 +313,14 @@ comments: true ```js title="quick_sort.js" /* 快速排序 */ - function quickSort(nums, left, right){ + function quickSort(nums, left, right) { // 子数组长度为 1 时终止递归 - if(left >= right) return + if (left >= right) return; // 哨兵划分 - const pivot = partition(nums, left, right) + const pivot = partition(nums, left, right); // 递归左子数组、右子数组 - quick_sort(nums, left, pivot - 1) - quick_sort(nums, pivot + 1, right) + quickSort(nums, left, pivot - 1); + quickSort(nums, pivot + 1, right); } ``` diff --git a/docs/chapter_stack_and_queue/deque.md b/docs/chapter_stack_and_queue/deque.md index 52b0540d..b8d4df9a 100644 --- a/docs/chapter_stack_and_queue/deque.md +++ b/docs/chapter_stack_and_queue/deque.md @@ -18,16 +18,16 @@ comments: true
-| 方法 | 描述 | -| ------------ | ---------------- | -| offerFirst() | 将元素添加至队首 | -| offerLast() | 将元素添加至队尾 | -| pollFirst() | 删除队首元素 | -| pollLast() | 删除队尾元素 | -| peekFirst() | 访问队首元素 | -| peekLast() | 访问队尾元素 | -| size() | 获取队列的长度 | -| isEmpty() | 判断队列是否为空 | +| 方法 | 描述 | 时间复杂度 | +| ------------ | ---------------- | ---------- | +| offerFirst() | 将元素添加至队首 | $O(1)$ | +| offerLast() | 将元素添加至队尾 | $O(1)$ | +| pollFirst() | 删除队首元素 | $O(1)$ | +| pollLast() | 删除队尾元素 | $O(1)$ | +| peekFirst() | 访问队首元素 | $O(1)$ | +| peekLast() | 访问队尾元素 | $O(1)$ | +| size() | 获取队列的长度 | $O(1)$ | +| isEmpty() | 判断队列是否为空 | $O(1)$ |
@@ -196,5 +196,29 @@ comments: true === "Swift" ```swift title="deque.swift" + /* 初始化双向队列 */ + // Swift 没有内置的双向队列类，可以把 Array 当作双向队列来使用 + var deque: [Int] = [] + /* 元素入队 */ + deque.append(2) // 添加至队尾 + deque.append(5) + deque.append(4) + deque.insert(3, at: 0) // 添加至队首 + deque.insert(1, at: 0) + + /* 访问元素 */ + let peekFirst = deque.first! // 队首元素 + let peekLast = deque.last! // 队尾元素 + + /* 元素出队 */ + // 使用 Array 模拟时 pollFirst 的复杂度为 O(n) + let pollFirst = deque.removeFirst() // 队首元素出队 + let pollLast = deque.removeLast() // 队尾元素出队 + + /* 获取双向队列的长度 */ + let size = deque.count + + /* 判断双向队列是否为空 */ + let isEmpty = deque.isEmpty ``` diff --git a/docs/chapter_stack_and_queue/queue.md b/docs/chapter_stack_and_queue/queue.md index 0c589fa6..35d6c41f 100644 --- a/docs/chapter_stack_and_queue/queue.md +++ b/docs/chapter_stack_and_queue/queue.md @@ -20,13 +20,13 @@ comments: true
-| 方法 | 描述 | -| --------- | ---------------------------- | -| offer() | 元素入队，即将元素添加至队尾 | -| poll() | 队首元素出队 | -| front() | 访问队首元素 | -| size() | 获取队列的长度 | -| isEmpty() | 判断队列是否为空 | +| 方法 | 描述 | 时间复杂度 | +| --------- | ---------------------------- | ---------- | +| offer() | 元素入队，即将元素添加至队尾 | $O(1)$ | +| poll() | 队首元素出队 | $O(1)$ | +| front() | 访问队首元素 | $O(1)$ | +| size() | 获取队列的长度 | $O(1)$ | +| isEmpty() | 判断队列是否为空 | $O(1)$ |
@@ -231,7 +231,29 @@ comments: true === "Swift" ```swift title="queue.swift" + /* 初始化队列 */ + // Swift 没有内置的队列类，可以把 Array 当作队列来使用 + var queue: [Int] = [] + /* 元素入队 */ + queue.append(1) + queue.append(3) + queue.append(2) + queue.append(5) + queue.append(4) + + /* 访问队首元素 */ + let peek = queue.first! + + /* 元素出队 */ + // 使用 Array 模拟时 poll 的复杂度为 O(n) + let pool = queue.removeFirst() + + /* 获取队列的长度 */ + let size = queue.count + + /* 判断队列是否为空 */ + let isEmpty = queue.isEmpty ``` ## 队列实现 @@ -309,6 +331,10 @@ comments: true rear = nullptr; queSize = 0; } + ~LinkedListQueue() { + delete front; + delete rear; + } /* 获取队列的长度 */ int size() { return queSize; @@ -627,7 +653,59 @@ comments: true === "Swift" ```swift title="linkedlist_queue.swift" + /* 基于链表实现的队列 */ + class LinkedListQueue { + private var front: ListNode? // 头结点 + private var rear: ListNode? // 尾结点 + private var _size = 0 + init() {} + + /* 获取队列的长度 */ + func size() -> Int { + _size + } + + /* 判断队列是否为空 */ + func isEmpty() -> Bool { + size() == 0 + } + + /* 入队 */ + func offer(num: Int) { + // 尾结点后添加 num + let node = ListNode(x: num) + // 如果队列为空，则令头、尾结点都指向该结点 + if front == nil { + front = node + rear = node + } + // 如果队列不为空，则将该结点添加到尾结点后 + else { + rear?.next = node + rear = node + } + _size += 1 + } + + /* 出队 */ + @discardableResult + func poll() -> Int { + let num = peek() + // 删除头结点 + front = front?.next + _size -= 1 + return num + } + + /* 访问队首元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("队列为空") + } + return front!.val + } + } ``` ### 基于数组的实现 @@ -711,6 +789,9 @@ comments: true cap = capacity; nums = new int[capacity]; } + ~ArrayQueue() { + delete[] nums; + } /* 获取队列的容量 */ int capacity() { return cap; @@ -1042,7 +1123,63 @@ comments: true === "Swift" ```swift title="array_queue.swift" + /* 基于环形数组实现的队列 */ + class ArrayQueue { + private var nums: [Int] // 用于存储队列元素的数组 + private var front = 0 // 头指针，指向队首 + private var rear = 0 // 尾指针，指向队尾 + 1 + init(capacity: Int) { + // 初始化数组 + nums = Array(repeating: 0, count: capacity) + } + + /* 获取队列的容量 */ + func capacity() -> Int { + nums.count + } + + /* 获取队列的长度 */ + func size() -> Int { + let capacity = capacity() + // 由于将数组看作为环形，可能 rear < front ，因此需要取余数 + return (capacity + rear - front) % capacity + } + + /* 判断队列是否为空 */ + func isEmpty() -> Bool { + rear - front == 0 + } + + /* 入队 */ + func offer(num: Int) { + if size() == capacity() { + print("队列已满") + return + } + // 尾结点后添加 num + nums[rear] = num + // 尾指针向后移动一位，越过尾部后返回到数组头部 + rear = (rear + 1) % capacity() + } + + /* 出队 */ + @discardableResult + func poll() -> Int { + let num = peek() + // 队头指针向后移动一位，若越过尾部则返回到数组头部 + front = (front + 1) % capacity() + return num + } + + /* 访问队首元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("队列为空") + } + return nums[front] + } + } ``` ## 队列典型应用 diff --git a/docs/chapter_stack_and_queue/stack.md b/docs/chapter_stack_and_queue/stack.md index d5a3f916..66b46187 100644 --- a/docs/chapter_stack_and_queue/stack.md +++ b/docs/chapter_stack_and_queue/stack.md @@ -22,13 +22,13 @@ comments: true
-| 方法 | 描述 | -| --------- | ---------------------- | -| push() | 元素入栈（添加至栈顶） | -| pop() | 栈顶元素出栈 | -| peek() | 访问栈顶元素 | -| size() | 获取栈的长度 | -| isEmpty() | 判断栈是否为空 | +| 方法 | 描述 | 时间复杂度 | +| --------- | ---------------------- | ---------- | +| push() | 元素入栈（添加至栈顶） | $O(1)$ | +| pop() | 栈顶元素出栈 | $O(1)$ | +| peek() | 访问栈顶元素 | $O(1)$ | +| size() | 获取栈的长度 | $O(1)$ | +| isEmpty() | 判断栈是否为空 | $O(1)$ |
@@ -231,7 +231,28 @@ comments: true === "Swift" ```swift title="stack.swift" + /* 初始化栈 */ + // Swift 没有内置的栈类，可以把 Array 当作栈来使用 + var stack: [Int] = [] + /* 元素入栈 */ + stack.append(1) + stack.append(3) + stack.append(2) + stack.append(5) + stack.append(4) + + /* 访问栈顶元素 */ + let peek = stack.last! + + /* 元素出栈 */ + let pop = stack.removeLast() + + /* 获取栈的长度 */ + let size = stack.count + + /* 判断是否为空 */ + let isEmpty = stack.isEmpty ``` ## 栈的实现 @@ -303,6 +324,9 @@ comments: true stackTop = nullptr; stkSize = 0; } + ~LinkedListStack() { + freeMemoryLinkedList(stackTop); + } /* 获取栈的长度 */ int size() { return stkSize; @@ -606,7 +630,48 @@ comments: true === "Swift" ```swift title="linkedlist_stack.swift" + /* 基于链表实现的栈 */ + class LinkedListStack { + private var _peek: ListNode? // 将头结点作为栈顶 + private var _size = 0 // 栈的长度 + init() {} + + /* 获取栈的长度 */ + func size() -> Int { + _size + } + + /* 判断栈是否为空 */ + func isEmpty() -> Bool { + size() == 0 + } + + /* 入栈 */ + func push(num: Int) { + let node = ListNode(x: num) + node.next = _peek + _peek = node + _size += 1 + } + + /* 出栈 */ + @discardableResult + func pop() -> Int { + let num = peek() + _peek = _peek?.next + _size -= 1 + return num + } + + /* 访问栈顶元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return _peek!.val + } + } ``` ### 基于数组的实现 @@ -897,7 +962,47 @@ comments: true === "Swift" ```swift title="array_stack.swift" + /* 基于数组实现的栈 */ + class ArrayStack { + private var stack: [Int] + init() { + // 初始化列表（动态数组） + stack = [] + } + + /* 获取栈的长度 */ + func size() -> Int { + stack.count + } + + /* 判断栈是否为空 */ + func isEmpty() -> Bool { + stack.isEmpty + } + + /* 入栈 */ + func push(num: Int) { + stack.append(num) + } + + /* 出栈 */ + @discardableResult + func pop() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return stack.removeLast() + } + + /* 访问栈顶元素 */ + func peek() -> Int { + if isEmpty() { + fatalError("栈为空") + } + return stack.last! + } + } ``` !!! tip diff --git a/docs/chapter_tree/binary_search_tree.md b/docs/chapter_tree/binary_search_tree.md index a0322154..ca8a9202 100644 --- a/docs/chapter_tree/binary_search_tree.md +++ b/docs/chapter_tree/binary_search_tree.md @@ -22,19 +22,15 @@ comments: true - 若 `cur.val = num` ，说明找到目标结点，跳出循环并返回该结点即可； === "Step 1" - ![bst_search_1](binary_search_tree.assets/bst_search_1.png) === "Step 2" - ![bst_search_2](binary_search_tree.assets/bst_search_2.png) === "Step 3" - ![bst_search_3](binary_search_tree.assets/bst_search_3.png) === "Step 4" - ![bst_search_4](binary_search_tree.assets/bst_search_4.png) 二叉搜索树的查找操作和二分查找算法如出一辙，也是在每轮排除一半情况。循环次数最多为二叉树的高度，当二叉树平衡时，使用 $O(\log n)$ 时间。 diff --git a/docs/chapter_tree/binary_tree.md b/docs/chapter_tree/binary_tree.md index 077c03e0..0201f6a2 100644 --- a/docs/chapter_tree/binary_tree.md +++ b/docs/chapter_tree/binary_tree.md @@ -114,7 +114,7 @@ comments: true 结点的两个指针分别指向「左子结点 Left Child Node」和「右子结点 Right Child Node」，并且称该结点为两个子结点的「父结点 Parent Node」。给定二叉树某结点，将左子结点以下的树称为该结点的「左子树 Left Subtree」，右子树同理。 -除了叶结点外，每个结点都有子结点和子树。例如，若将上图的「结点 2」看作父结点，那么其左子结点和右子结点分别为「结点 4」和「结点 5」，左子树和右子树分别为「结点 4 以下的树」和「结点 5 以下的树」。 +除了叶结点外，每个结点都有子结点和子树。例如，若将下图的「结点 2」看作父结点，那么其左子结点和右子结点分别为「结点 4」和「结点 5」，左子树和右子树分别为「结点 4 及其以下结点形成的树」和「结点 5 及其以下结点形成的树」。 ![binary_tree_definition](binary_tree.assets/binary_tree_definition.png) diff --git a/docs/chapter_tree/summary.md b/docs/chapter_tree/summary.md index a46a253f..15dc2f6d 100644 --- a/docs/chapter_tree/summary.md +++ b/docs/chapter_tree/summary.md @@ -15,4 +15,4 @@ comments: true - 前序、中序、后序遍历是深度优先搜索，体现着“走到头、再回头继续”的回溯遍历方式，通常使用递归实现。 - 二叉搜索树是一种高效的元素查找数据结构，查找、插入、删除操作的时间复杂度皆为 $O(\log n)$ 。二叉搜索树退化为链表后，各项时间复杂度劣化至 $O(n)$ ，因此如何避免退化是非常重要的课题。 - AVL 树又称平衡二叉搜索树，其通过旋转操作，使得在不断插入与删除结点后，仍然可以保持二叉树的平衡（不退化）。 -- AVL 树的旋转操作分为右旋、左旋、先右旋后左旋、先左旋后右旋。在插入或删除结点后，AVL 树会从底置顶地执行旋转操作，使树恢复平衡。 +- AVL 树的旋转操作分为右旋、左旋、先右旋后左旋、先左旋后右旋。在插入或删除结点后，AVL 树会从底至顶地执行旋转操作，使树恢复平衡。 diff --git a/docs/index.assets/animation.gif b/docs/index.assets/animation.gif index 6522ef9f..60f53f20 100644 Binary files a/docs/index.assets/animation.gif and b/docs/index.assets/animation.gif differ diff --git a/docs/index.assets/comment.gif b/docs/index.assets/comment.gif index d64787ac..e7a74cf9 100644 Binary files a/docs/index.assets/comment.gif and b/docs/index.assets/comment.gif differ diff --git a/docs/index.assets/conceptual_rendering.png b/docs/index.assets/conceptual_rendering.png index 591d633b..87c5181a 100644 Binary files a/docs/index.assets/conceptual_rendering.png and b/docs/index.assets/conceptual_rendering.png differ diff --git a/docs/index.assets/demo.png b/docs/index.assets/demo.png deleted file mode 100644 index af3e0059..00000000 Binary files a/docs/index.assets/demo.png and /dev/null differ diff --git a/docs/index.assets/learning_route.png b/docs/index.assets/learning_route.png deleted file mode 100644 index 7423808d..00000000 Binary files a/docs/index.assets/learning_route.png and /dev/null differ diff --git a/docs/index.assets/running_code.gif b/docs/index.assets/running_code.gif index 7377773c..dfe17531 100644 Binary files a/docs/index.assets/running_code.gif and b/docs/index.assets/running_code.gif differ diff --git a/mkdocs.yml b/mkdocs.yml index 9ddae9f3..ad836ae9 100644 --- a/mkdocs.yml +++ b/mkdocs.yml @@ -161,6 +161,8 @@ nav: - 二叉搜索树: chapter_tree/binary_search_tree.md - AVL 树 *: chapter_tree/avl_tree.md - 小结: chapter_tree/summary.md + - 堆: + - 堆（Heap）: chapter_heap/heap.md - 查找算法: - 线性查找: chapter_searching/linear_search.md - 二分查找: chapter_searching/binary_search.md