Day 28
Date: October 24, 2022 1:25 PM
LinkedIn: https://leetcode.cn/problems/partition-array-into-disjoint-intervals/description/
Title: 分割数组
class Solution:
def partitionDisjoint(self, nums: List[int]) -> int:
mn = nums[0] # left左边的最大值
mx = mn # 中间最大值
l = 1 # 左边长度
for i in range(1, len(nums)):
if mx < nums[i]:
mx = nums[i]
if mn <= nums[i]:# 左边最大值不大于右边第一个
continue
else:
mn = mx# 更新左边最大值
l += (i+1-l)# 左边个数加上 之前左边索引到i的个数
return l