Update js code format

docs/chapter_computational_complexity/space_time_tradeoff.md

@@ -96,7 +96,7 @@ comments: true
         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 [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;
             }