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

YangFong · YangFong · commit e419d0a18bf8 · 2022-05-20T10:56:16.000+08:00
No.0436.Find Right Interval
diff --git a/solution/0400-0499/0436.Find Right Interval/README.md b/solution/0400-0499/0436.Find Right Interval/README.md
@@ -174,6 +174,37 @@ func findRightInterval(intervals [][]int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findRightInterval(intervals: number[][]): number[] {
+    const n = intervals.length;
+    const starts = Array.from({ length: n }).map(() => new Array<number>(2));
+    for (let i = 0; i < n; i++) {
+        starts[i][0] = intervals[i][0];
+        starts[i][1] = i;
+    }
+    starts.sort((a, b) => a[0] - b[0]);
+
+    return intervals.map(([_, target]) => {
+        let left = 0;
+        let right = n;
+        while (left < right) {
+            const mid = (left + right) >>> 1;
+            if (starts[mid][0] < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        if (left >= n) {
+            return -1;
+        }
+        return starts[left][1];
+    });
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0400-0499/0436.Find Right Interval/README_EN.md b/solution/0400-0499/0436.Find Right Interval/README_EN.md
@@ -165,6 +165,37 @@ func findRightInterval(intervals [][]int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findRightInterval(intervals: number[][]): number[] {
+    const n = intervals.length;
+    const starts = Array.from({ length: n }).map(() => new Array<number>(2));
+    for (let i = 0; i < n; i++) {
+        starts[i][0] = intervals[i][0];
+        starts[i][1] = i;
+    }
+    starts.sort((a, b) => a[0] - b[0]);
+
+    return intervals.map(([_, target]) => {
+        let left = 0;
+        let right = n;
+        while (left < right) {
+            const mid = (left + right) >>> 1;
+            if (starts[mid][0] < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        if (left >= n) {
+            return -1;
+        }
+        return starts[left][1];
+    });
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0400-0499/0436.Find Right Interval/Solution.ts b/solution/0400-0499/0436.Find Right Interval/Solution.ts
@@ -0,0 +1,26 @@
+function findRightInterval(intervals: number[][]): number[] {
+    const n = intervals.length;
+    const starts = Array.from({ length: n }).map(() => new Array<number>(2));
+    for (let i = 0; i < n; i++) {
+        starts[i][0] = intervals[i][0];
+        starts[i][1] = i;
+    }
+    starts.sort((a, b) => a[0] - b[0]);
+
+    return intervals.map(([_, target]) => {
+        let left = 0;
+        let right = n;
+        while (left < right) {
+            const mid = (left + right) >>> 1;
+            if (starts[mid][0] < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        if (left >= n) {
+            return -1;
+        }
+        return starts[left][1];
+    });
+}
