Leetcode Problem 915. Partition Array into Disjoint Intervals

915. Partition Array into Disjoint Intervals

Leetcode Solutions

Initialize curr_max and possible_max to nums[0], and length to 1.
Iterate over the array starting from index 1.
- If nums[i] < curr_max, update length to i + 1 and set curr_max to possible_max.
- Otherwise, if nums[i] >= curr_max, update possible_max to max(possible_max, nums[i]) if nums[i] is greater.
Return length as the size of the left subarray.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen