build

docs/chapter_computational_complexity/space_complexity.md

@@ -1254,13 +1254,11 @@ $$
 
     ```c title="space_complexity.c"
     /* 哈希表 */
-    struct hashTable {
+    typedef struct {
         int key;
         int val;
         UT_hash_handle hh; // 基于 uthash.h 实现
-    };
-
-    typedef struct hashTable hashTable;
+    } HashTable;
 
     /* 线性阶 */
     void linear(int n) {
@@ -1280,16 +1278,16 @@ $$
         free(nodes);
 
         // 长度为 n 的哈希表占用 O(n) 空间
-        hashTable *h = NULL;
+        HashTable *h = NULL;
         for (int i = 0; i < n; i++) {
-            hashTable *tmp = malloc(sizeof(hashTable));
+            HashTable *tmp = malloc(sizeof(HashTable));
             tmp->key = i;
             tmp->val = i;
             HASH_ADD_INT(h, key, tmp);
         }
 
         // 内存释放
-        hashTable *curr, *tmp;
+        HashTable *curr, *tmp;
         HASH_ITER(hh, h, curr, tmp) {
             HASH_DEL(h, curr);
             free(curr);