diff --git a/docs/chapter_hashing/hash_collision.md b/docs/chapter_hashing/hash_collision.md index 4b0e97f26..82d94fb4c 100644 --- a/docs/chapter_hashing/hash_collision.md +++ b/docs/chapter_hashing/hash_collision.md @@ -2769,7 +2769,7 @@ comments: true // 若找到键值对,则覆盖 val 并返回 if (hashMap->buckets[index] != NULL && hashMap->buckets[index] != hashMap->TOMBSTONE) { free(hashMap->buckets[index]->val); - hashMap->buckets[index]->val = (char *)malloc(sizeof(strlen(val + 1))); + hashMap->buckets[index]->val = (char *)malloc(sizeof(strlen(val) + 1)); strcpy(hashMap->buckets[index]->val, val); hashMap->buckets[index]->val[strlen(val)] = '\0'; return; @@ -2777,7 +2777,7 @@ comments: true // 若键值对不存在,则添加该键值对 Pair *pair = (Pair *)malloc(sizeof(Pair)); pair->key = key; - pair->val = (char *)malloc(sizeof(strlen(val + 1))); + pair->val = (char *)malloc(sizeof(strlen(val) + 1)); strcpy(pair->val, val); pair->val[strlen(val)] = '\0'; diff --git a/docs/chapter_preface/about_the_book.md b/docs/chapter_preface/about_the_book.md index e12116a1c..6123bfe20 100644 --- a/docs/chapter_preface/about_the_book.md +++ b/docs/chapter_preface/about_the_book.md @@ -30,7 +30,7 @@ comments: true - **数据结构**:基本数据类型和数据结构的分类方法。数组、链表、栈、队列、哈希表、树、堆、图等数据结构的定义、优缺点、常用操作、常见类型、典型应用、实现方法等。 - **算法**:搜索、排序、分治、回溯、动态规划、贪心等算法的定义、优缺点、效率、应用场景、解题步骤和示例问题等。 -![本书主要内容](about_the_book.assets/hello_algo_mindmap.jpg){ class="animation-figure" } +![本书主要内容](about_the_book.assets/hello_algo_mindmap.png){ class="animation-figure" }

图 0-1   本书主要内容

diff --git a/docs/chapter_sorting/counting_sort.md b/docs/chapter_sorting/counting_sort.md index f0c85e986..1ca30240b 100644 --- a/docs/chapter_sorting/counting_sort.md +++ b/docs/chapter_sorting/counting_sort.md @@ -299,7 +299,7 @@ comments: true } // 2. 统计各数字的出现次数 // counter[num] 代表 num 的出现次数 - int *counter = calloc(m, sizeof(int)); + int *counter = calloc(m + 1, sizeof(int)); for (int i = 0; i < size; i++) { counter[nums[i]]++; } diff --git a/docs/chapter_tree/binary_search_tree.md b/docs/chapter_tree/binary_search_tree.md index 8ab97eda4..f27146f2e 100755 --- a/docs/chapter_tree/binary_search_tree.md +++ b/docs/chapter_tree/binary_search_tree.md @@ -1387,6 +1387,8 @@ comments: true } else { pre->right = child; } + // 释放内存 + free(cur); } else { /* 子节点数量 = 2 */ // 获取中序遍历中 cur 的下一个节点