Leetcode 918. Maximum Sum Circular Subarray [Python]

Kadane Algo,暴力的遍历全部的nums组合。会在第97个TC的时候TLE

class Solution:
    def maxSubarraySumCircular(self, nums: List[int]) -> int:
        window = len(nums)
        self.res = float('-inf')
        for idx in range(len(nums)):
            numnums = nums[idx:] + nums[:idx]
            #print(numnums)
            self.res = max(self.res, self.kadane(numnums))
        return self.res
        
    def kadane(self, arr):
        maxall = float('-inf')
        maxendhere = 0
        for i in range( len(arr)):
            maxendhere = maxendhere + arr[i]
            if maxall < maxendhere:
                maxall = maxendhere
            if maxendhere < 0:
                maxendhere = 0
        return maxall

接下来优化版本,对于一个环形的array，我们要保留可能是两头的数字组合成的最大subarray，可以反过来想，我们找到位于中间的最小的subarray，然后用sum（array）来减去最小的subarray，就可以得到了。当然，此时还是需要和正常求得得subarray的sum值来比较，从而选择最大的。而如果nums全是负数的话，则看正常求得的就足够了。

class Solution:
    def maxSubarraySumCircular(self, nums: List[int]) -> int:
        return self.kadane(nums)
        
        
    def kadane(self, nums):
        maxall = float('-inf')
        maxnow = 0
        _sum = 0
        for i in range(len(nums)):
            maxnow += nums[i]
            maxall = max(maxall, maxnow)
            _sum += nums[i]
            if maxnow < 0:
                maxnow = 0
                
        #reverse part
        minall = float('inf')
        minnow = 0
        neg_count = 0
        for i in range(len(nums)):
            minnow += nums[i]
            minall = min(minall, minnow)
            if minnow > 0:
                minnow = 0
            if nums[i] < 0:
                neg_count += 1
            
        
        if neg_count == len(nums):return maxall
        
        return max(maxall, _sum - minall)

Kadane算法也是必备模版了看来

def kadane(arr):
	maxall = float('-inf')
	maxcur = 0
	for i in range(len(arr)):
		maxcur = maxcur + arr[i]
		if maxcur > maxall:
			maxall = maxcur
		if maxcur < 0:
			maxcur = 0
	return maxall