feat: add ts solution to lc problem: No.0035

Author: rain84

solution/0000-0099/0035.Search Insert Position/README.md

@@ -189,6 +189,23 @@ var searchInsert = function (nums, target) {
 };
 ```
 
+#### TypeScript
+
+```ts
+function searchInsert(nums: number[], target: number): number {
+    let [l, r] = [0, nums.length - 1];
+
+    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;
+    }
+
+    return l;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0035.Search Insert Position/README_EN.md

@@ -187,6 +187,23 @@ var searchInsert = function (nums, target) {
 };
 ```
 
+#### TypeScript
+
+```ts
+function searchInsert(nums: number[], target: number): number {
+    let [l, r] = [0, nums.length - 1];
+
+    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;
+    }
+
+    return l;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,12 @@
+function searchInsert(nums: number[], target: number): number {
+    let [l, r] = [0, nums.length - 1];
+
+    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;
+    }
+
+    return l;
+}