diff --git a/codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts b/codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts
index 0087d1ce8..8e3c4cd76 100644
--- a/codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts
+++ b/codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts
@@ -5,7 +5,7 @@
  */
 
 function twoSumBruteForce(nums: number[], target: number): number[] {
-    let n = nums.length;
+    const n = nums.length;
     // 两层循环，时间复杂度 O(n^2)
     for (let i = 0; i < n; i++) {
         for (let j = i + 1; j < n; j++) {
@@ -33,10 +33,12 @@ function twoSumHashTable(nums: number[], target: number): number[] {
 };
 
 /* Driver Code */
-let nums = [2, 7, 11, 15], target = 9;
-twoSumBruteForce(nums, target)
-console.log("使用暴力枚举后得到结果：", nums)
+// 方法一
+const nums = [2, 7, 11, 15], target = 9;
 
-let nums1 = [2, 7, 11, 15], target1 = 9;
-twoSumHashTable(nums1, target1)
-console.log("使用辅助哈希表后得到结果", nums1)
\ No newline at end of file
+let res = twoSumBruteForce(nums, target);
+console.log("方法一 res = ", res);
+
+// 方法二
+res = twoSumHashTable(nums, target);
+console.log("方法二 res = ", res);
\ No newline at end of file
diff --git a/docs/chapter_computational_complexity/space_time_tradeoff.md b/docs/chapter_computational_complexity/space_time_tradeoff.md
index 40b1d57e9..b29b03fa0 100644
--- a/docs/chapter_computational_complexity/space_time_tradeoff.md
+++ b/docs/chapter_computational_complexity/space_time_tradeoff.md
@@ -97,7 +97,7 @@ comments: true
 
     ```typescript title="leetcode_two_sum.ts"
     function twoSumBruteForce(nums: number[], target: number): number[] {
-        let n = nums.length;
+        const n = nums.length;
         // 两层循环，时间复杂度 O(n^2)
         for (let i = 0; i < n; i++) {
             for (let j = i + 1; j < n; j++) {