From 76693ab0fbe7e0751064cbacd988e7b6a13fa230 Mon Sep 17 00:00:00 2001
From: gyt95 <gyt95@163.com>
Date: Thu, 15 Dec 2022 23:50:08 +0800
Subject: [PATCH] Update js code format

---
 .../space_time_tradeoff.md                    | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/docs/chapter_computational_complexity/space_time_tradeoff.md b/docs/chapter_computational_complexity/space_time_tradeoff.md
index 140f1ef95..99a08d95e 100644
--- a/docs/chapter_computational_complexity/space_time_tradeoff.md
+++ b/docs/chapter_computational_complexity/space_time_tradeoff.md
@@ -91,15 +91,15 @@ comments: true
 
     ```js title="leetcode_two_sum.js"
     function twoSumBruteForce(nums, target) {
-      let 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]
-          }
+        let 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];
+                }
+            }
         }
-      }
     }
     ```
 
@@ -205,11 +205,11 @@ comments: true
     ```js title="leetcode_two_sum.js"
     function twoSumHashTable(nums, target) {
         // 辅助哈希表，空间复杂度 O(n)
-        let m = {}
+        let m = {};
         // 单层循环，时间复杂度 O(n)
         for (let i = 0; i < nums.length; i++) {
             if (m[nums[i]] !== undefined) {
-                return [m[nums[i]], i]
+                return [m[nums[i]], i];
             } else {
                 m[target - nums[i]] = i;
             }