upperBound

Author: masx200

maximum-profit-in-job-scheduling/index.ts

@@ -1,5 +1,4 @@
 import { upperBound } from "./upperBound.ts";
-
 function jobScheduling(
     startTime: number[],
     endTime: number[],
@@ -12,13 +11,7 @@ function jobScheduling(
     const n = startTime.length;
     const dp = Array<number>(n + 1).fill(0);
     for (let i = 1; i <= n; i++) {
-        const k = upperBound(
-            jobs,
-            jobs[i - 1][0],
-            (v, x) => v[1] > x,
-            0,
-            i - 1,
-        );
+        const k = upperBound(0, i - 1, (m) => jobs[m][1] > jobs[i - 1][0]);
         dp[i] = Math.max(dp[i - 1], dp[k] + jobs[i - 1][2]);
     }
 

maximum-profit-in-job-scheduling/lowerBound.ts

@@ -1,13 +1,11 @@
 export function lowerBound(
-    a: number[][],
-    x: number,
-    less: (v: number[], x: number) => boolean,
-    left = 0,
-    right = a.length,
+    left: number,
+    right: number,
+    less: (m: number) => boolean,
 ) {
     while (left < right) {
         const mid = Math.floor(left + (right - left) / 2);
-        if (less(a[mid], x)) left = mid + 1;
+        if (less(mid)) left = mid + 1;
         else right = mid;
     }
     return left;

maximum-profit-in-job-scheduling/upperBound.ts

@@ -1,13 +1,11 @@
 export function upperBound(
-    a: number[][],
-    x: number,
-    greater: (v: number[], x: number) => boolean,
-    left = 0,
-    right = a.length,
+    left: number,
+    right: number,
+    greater: (m: number) => boolean,
 ): number {
     while (left < right) {
         const mid = Math.floor(left + (right - left) / 2);
-        if (greater(a[mid], x)) right = mid;
+        if (greater(mid)) right = mid;
         else left = mid + 1;
     }
     return left;