LeetCode 410 分割数组的最大值

采用二分搜索的方法

import sys
class Solution:

    def splitArray(self, nums: List[int], m: int) -> int:
        lo,hi=-sys.maxsize,0
        for val in nums:
            hi+=val
            lo=max(lo,val)
        res=hi
        while lo<=hi:
            mid=(hi+lo)//2
            if self.check(nums,mid,m):
                hi=mid-1
                res=mid
            else:
                lo=mid+1
        return res

    def check(self,nums,val,m):
        cnt=1
        tem_sum=0
        for i,num in enumerate(nums):
            tem_sum+=num
            if tem_sum>val:
                cnt+=1
                tem_sum=num
    #    print(cnt)
        return cnt<=m