feat: add solutions to lc problem: No.1235

No.1235.Maximum Profit in Job Scheduling

Author: yanglbme

solution/1200-1299/1235.Maximum Profit in Job Scheduling/README.md

@@ -123,6 +123,21 @@ class Solution:
         return dfs(0)
 ```
 
+```python
+class Solution:
+    def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:
+        @cache
+        def dfs(i: int) -> int:
+            if i >= n:
+                return 0
+            j = bisect_left(idx, endTime[idx[i]], key=lambda i: startTime[i])
+            return max(dfs(i + 1), profit[idx[i]] + dfs(j))
+
+        n = len(startTime)
+        idx = sorted(range(n), key=lambda i: startTime[i])
+        return dfs(0)
+```
+
 ```python
 class Solution:
     def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:
@@ -323,6 +338,45 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function jobScheduling(
+    startTime: number[],
+    endTime: number[],
+    profit: number[],
+): number {
+    const n = startTime.length;
+    const f = new Array(n).fill(0);
+    const idx = new Array(n).fill(0).map((_, i) => i);
+    idx.sort((i, j) => startTime[i] - startTime[j]);
+    const search = (x: number) => {
+        let l = 0;
+        let r = n;
+        while (l < r) {
+            const mid = (l + r) >> 1;
+            if (startTime[idx[mid]] >= x) {
+                r = mid;
+            } else {
+                l = mid + 1;
+            }
+        }
+        return l;
+    };
+    const dfs = (i: number): number => {
+        if (i >= n) {
+            return 0;
+        }
+        if (f[i] !== 0) {
+            return f[i];
+        }
+        const j = search(endTime[idx[i]]);
+        return (f[i] = Math.max(dfs(i + 1), dfs(j) + profit[idx[i]]));
+    };
+    return dfs(0);
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1235.Maximum Profit in Job Scheduling/README_EN.md

@@ -73,6 +73,21 @@ class Solution:
         return dfs(0)
 ```
 
+```python
+class Solution:
+    def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:
+        @cache
+        def dfs(i: int) -> int:
+            if i >= n:
+                return 0
+            j = bisect_left(idx, endTime[idx[i]], key=lambda i: startTime[i])
+            return max(dfs(i + 1), profit[idx[i]] + dfs(j))
+
+        n = len(startTime)
+        idx = sorted(range(n), key=lambda i: startTime[i])
+        return dfs(0)
+```
+
 ```python
 class Solution:
     def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:
@@ -271,6 +286,45 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function jobScheduling(
+    startTime: number[],
+    endTime: number[],
+    profit: number[],
+): number {
+    const n = startTime.length;
+    const f = new Array(n).fill(0);
+    const idx = new Array(n).fill(0).map((_, i) => i);
+    idx.sort((i, j) => startTime[i] - startTime[j]);
+    const search = (x: number) => {
+        let l = 0;
+        let r = n;
+        while (l < r) {
+            const mid = (l + r) >> 1;
+            if (startTime[idx[mid]] >= x) {
+                r = mid;
+            } else {
+                l = mid + 1;
+            }
+        }
+        return l;
+    };
+    const dfs = (i: number): number => {
+        if (i >= n) {
+            return 0;
+        }
+        if (f[i] !== 0) {
+            return f[i];
+        }
+        const j = search(endTime[idx[i]]);
+        return (f[i] = Math.max(dfs(i + 1), dfs(j) + profit[idx[i]]));
+    };
+    return dfs(0);
+}
+```
+
 ### **...**
 
 ```

solution/1200-1299/1235.Maximum Profit in Job Scheduling/Solution.ts

@@ -0,0 +1,34 @@
+function jobScheduling(
+    startTime: number[],
+    endTime: number[],
+    profit: number[],
+): number {
+    const n = startTime.length;
+    const f = new Array(n).fill(0);
+    const idx = new Array(n).fill(0).map((_, i) => i);
+    idx.sort((i, j) => startTime[i] - startTime[j]);
+    const search = (x: number) => {
+        let l = 0;
+        let r = n;
+        while (l < r) {
+            const mid = (l + r) >> 1;
+            if (startTime[idx[mid]] >= x) {
+                r = mid;
+            } else {
+                l = mid + 1;
+            }
+        }
+        return l;
+    };
+    const dfs = (i: number): number => {
+        if (i >= n) {
+            return 0;
+        }
+        if (f[i] !== 0) {
+            return f[i];
+        }
+        const j = search(endTime[idx[i]]);
+        return (f[i] = Math.max(dfs(i + 1), dfs(j) + profit[idx[i]]));
+    };
+    return dfs(0);
+}