Merge pull request #118 from gyt95/ts_chapter_computational_complexity

Add TS for chapter of computational complexity

codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts

@@ -0,0 +1,44 @@
+/*
+ * File: leetcode_two_sum.ts
+ * Created Time: 2022-12-15
+ * Author: gyt95 (gytkwan@gmail.com) 
+ */
+
+function twoSumBruteForce(nums: number[], target: number): number[] {
+    const n = nums.length;
+    // 两层循环，时间复杂度 O(n^2)
+    for (let i = 0; i < n; i++) {
+        for (let j = i + 1; j < n; j++) {
+            if (nums[i] + nums[j] === target) {
+                return [i, j];
+            }
+        }
+    }
+    return [];
+};
+
+function twoSumHashTable(nums: number[], target: number): number[] {
+    // 辅助哈希表，空间复杂度 O(n)
+    let m: Map<number, number> = new Map();
+    // 单层循环，时间复杂度 O(n)
+    for (let i = 0; i < nums.length; i++) {
+        let index = m.get(nums[i]);
+        if (index !== undefined) {
+            return [index, i];
+        } else {
+            m.set(target - nums[i], i);
+        }
+    }
+    return [];
+};
+
+/* Driver Code */
+// 方法一
+const nums = [2, 7, 11, 15], target = 9;
+
+let res = twoSumBruteForce(nums, target);
+console.log("方法一 res = ", res);
+
+// 方法二
+res = twoSumHashTable(nums, target);
+console.log("方法二 res = ", res);

docs/chapter_computational_complexity/space_time_tradeoff.md

@@ -96,7 +96,18 @@ comments: true
 === "TypeScript"
 
     ```typescript title="leetcode_two_sum.ts"
-
+    function twoSumBruteForce(nums: number[], target: number): number[] {
+        const n = nums.length;
+        // 两层循环，时间复杂度 O(n^2)
+        for (let i = 0; i < n; i++) {
+            for (let j = i + 1; j < n; j++) {
+                if (nums[i] + nums[j] === target) {
+                    return [i, j];
+                }
+            }
+        }
+        return [];
+    };
     ```
 
 === "C"
@@ -199,7 +210,20 @@ comments: true
 === "TypeScript"
 
     ```typescript title="leetcode_two_sum.ts"
-
+    function twoSumHashTable(nums: number[], target: number): number[] {
+        // 辅助哈希表，空间复杂度 O(n)
+        let m: Map<number, number> = new Map();
+        // 单层循环，时间复杂度 O(n)
+        for (let i = 0; i < nums.length; i++) {
+            let index = m.get(nums[i]);
+            if (index !== undefined) {
+                return [index, i];
+            } else {
+                m.set(target - nums[i], i);
+            }
+        }
+        return [];
+    };
     ```
 
 === "C"