Update Solution.ts

Author: yanglbme

solution/0000-0099/0035.Search Insert Position/Solution.ts

@@ -1,12 +1,12 @@
 function searchInsert(nums: number[], target: number): number {
-    let [l, r] = [0, nums.length - 1];
-
-    while (l <= r) {
+    let [l, r] = [0, nums.length];
+    while (l < r) {
         const mid = (l + r) >> 1;
-        if (nums[mid] === target) return mid;
-        if (nums[mid] < target) l = mid + 1;
-        else r = mid - 1;
+        if (nums[mid] >= target) {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
     }
-
     return l;
 }