LeetCode 53 最大子序和 python3

1、暴力，O(n^2) ，超时

2、贪心 （官方解法一）

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        # 思路：贪心，保留当前最大和
        size = len(nums)
        array=list()
        pre, maxsum = 0, nums[0]
        for i in range(size):
            pre = max(nums[i], pre+nums[i]) # 因为连续，对比pre+nums[i]和nums[i]
            maxsum = max(pre,maxsum)

        return maxsum

3、分治

还没透彻理解，过段时间再看看吧

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        size = len(nums)
        if size == 1:
            return nums[0]
        
        # 递归，把问题分解
        left_max = self.maxSubArray(nums[0:size//2])
        right_max = self.maxSubArray(nums[size//2:])

        # middle_lmax 和 middle_rmax 记录当前左边最大和以及右边最大和，以求解整个区间的最大和
        # 两个分别以左右为端点，求最大和

        middle_lmax = nums[size//2-1]
        temp = 0
        for i in range(size//2-1,-1,-1):
            temp += nums[i]
            middle_lmax = max(temp,middle_lmax)

        middle_rmax = nums[size//2]
        temp = 0
        for i in range(size//2,size):
            temp += nums[i]
            middle_rmax = max(temp,middle_rmax)
        
        return max(left_max,right_max,middle_lmax + middle_rmax)

4、动态规划

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        size = len(nums)
        if size == 1:
            return nums[0]
        # 当前面的数大于0时，与现在的数相加并保存，否则保留当前的数
        for i in range(1,size):
            if nums[i-1] > 0:
                nums[i] = nums[i-1] + nums[i]
        
        return max(nums[:])