【leetcode】最大子数组和

动态规划法

时间复杂度：O(n)

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        
        sum_pre = nums[0]
        sum_max = nums[0]
        for i in range(1, len(nums)):
            sum_pre = max(sum_pre+nums[i], nums[i])
            sum_max = max(sum_pre, sum_max)
        return sum_max

分治法

时间复杂度：O(nlog(n))
没有看懂写不出来呜呜