Format JS and TS code.

codes/javascript/chapter_searching/binary_search_insertion.js

@@ -60,5 +60,5 @@ for (const target of [2, 6, 20]) {
 }
 
 module.exports = {
-    binarySearchInsertion
-};
+    binarySearchInsertion,
+};

codes/javascript/chapter_searching/two_sum.js

@@ -25,7 +25,7 @@ function twoSumHashTable(nums, target) {
     // 单层循环，时间复杂度 O(n)
     for (let i = 0; i < nums.length; i++) {
         if (m[target - nums[i]] !== undefined) {
-            return [m[target-nums[i]], i];
+            return [m[target - nums[i]], i];
         } else {
             m[nums[i]] = i;
         }