22w3: add 35 js solution

Author: swiftwind0405

README.md

@@ -407,7 +407,7 @@
 |38|[Count and Say](https://leetcode.com/problems/count-and-say/)| |Easy|
 |37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| |Hard|
 |36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| |Easy|
-|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| |Medium|
+|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [js](./algorithms/searchInsertPosition/solution.js)  |Easy|
 |34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| |Medium|
 |33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| |Hard|
 |32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| |Hard|

algorithms/searchInsertPosition/solution.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function (nums, target) {
+  // target 在左闭右闭的区间里，[left, right]
+  let left = 0,
+    right = nums.length - 1,
+    result = nums.length;
+
+  // 因为题目要求时间复杂度是O(log n)，所以得使用二分查找法
+  while (left <= right) {
+    const middle = left + Math.floor((right - left) >> 1);
+    if (target > nums[middle]) {
+      left = middle + 1; // target在右区间
+    } else {
+      result = middle; // target在左区间
+      right = middle - 1;
+    }
+  }
+
+  return result;
+};