https://leetcode.cn/problems/partition-array-into-disjoint-intervals/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/partition-array-into-disjoint-intervals/
+
 https://leetcode.cn/problems/maximum-profit-in-job-scheduling/
 
 https://leetcode.cn/problems/booking-concert-tickets-in-groups/

partition-array-into-disjoint-intervals/index.ts

@@ -0,0 +1,14 @@
+export default function partitionDisjoint(nums: number[]): number {
+    const n = nums.length;
+    let leftMax = nums[0],
+        leftPos = 0,
+        curMax = nums[0];
+    for (let i = 1; i < n - 1; i++) {
+        curMax = Math.max(curMax, nums[i]);
+        if (nums[i] < leftMax) {
+            leftMax = curMax;
+            leftPos = i;
+        }
+    }
+    return leftPos + 1;
+}