build

chapter_computational_complexity/space_complexity.md

@@ -1332,8 +1332,8 @@ $$
     int quadraticRecur(int n)
     {
         if (n <= 0) return 0;
-        // 数组 nums 长度为 n, n-1, ..., 2, 1
         int[] nums = new int[n];
+        Console.WriteLine("递归 n = " + n + " 中的 nums 长度 = " + nums.Length);
         return quadraticRecur(n - 1);
     }
     ```

chapter_computational_complexity/space_time_tradeoff.md

@@ -139,22 +139,20 @@ comments: true
 === "C#"
 
     ```csharp title="leetcode_two_sum.cs"
-    class SolutionBruteForce
+    /* 方法一：暴力枚举 */
+    int[] twoSumBruteForce(int[] nums, int target)
     {
-        public int[] twoSum(int[] nums, int target)
+        int size = nums.Length;
+        // 两层循环，时间复杂度 O(n^2)
+        for (int i = 0; i < size - 1; i++)
         {
-            int size = nums.Length;
-            // 两层循环，时间复杂度 O(n^2)
-            for (int i = 0; i < size - 1; i++)
+            for (int j = i + 1; j < size; j++)
             {
-                for (int j = i + 1; j < size; j++)
-                {
-                    if (nums[i] + nums[j] == target)
-                        return new int[] { i, j };
-                }
+                if (nums[i] + nums[j] == target)
+                    return new int[] { i, j };
             }
-            return new int[0];
         }
+        return new int[0];
     }
     ```
 
@@ -321,24 +319,22 @@ comments: true
 === "C#"
 
     ```csharp title="leetcode_two_sum.cs"
-    class SolutionHashMap
+    /* 方法二：辅助哈希表 */
+    int[] twoSumHashTable(int[] nums, int target)
     {
-        public int[] twoSum(int[] nums, int target)
+        int size = nums.Length;
+        // 辅助哈希表，空间复杂度 O(n)
+        Dictionary<int, int> dic = new();
+        // 单层循环，时间复杂度 O(n)
+        for (int i = 0; i < size; i++)
         {
-            int size = nums.Length;
-            // 辅助哈希表，空间复杂度 O(n)
-            Dictionary<int, int> dic = new();
-            // 单层循环，时间复杂度 O(n)
-            for (int i = 0; i < size; i++)
+            if (dic.ContainsKey(target - nums[i]))
             {
-                if (dic.ContainsKey(target - nums[i]))
-                {
-                    return new int[] { dic[target - nums[i]], i };
-                }
-                dic.Add(nums[i], i);
+                return new int[] { dic[target - nums[i]], i };
             }
-            return new int[0];
+            dic.Add(nums[i], i);
         }
+        return new int[0];
     }
     ```
 

chapter_computational_complexity/time_complexity.md

@@ -1164,7 +1164,7 @@ $$
     {
         int count = 0;
         // 循环次数与数组长度成正比
-        foreach(int num in nums)
+        foreach (int num in nums)
         {
             count++;
         }
@@ -1560,7 +1560,6 @@ $$
         }
         return count;
     }
-
     ```
 
 === "Swift"