leetcode53：最大子序和

思路一

采用动态规划，设F(i)是以array[i]为结束点的最大子向量（从0开始），比如说F(3)就是最后一个向量是7的最大子串，可知
F(i) = max(F(i-1)+array[i],array[i])
设res是所有字串中最大的那个，也就是我们最后要求的值
res = max(res,F(i))

代码

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        res = nums[0]
        f = nums[0]
        for i in range(1,len(nums)):
            f = max(f + nums[i],nums[i])
            res = max(res,f)
        return res

思路二

和思路一其实差不多

class Solution(object):
    def maxSubArray(self, nums):
        if nums == None:
            return 0
        cursum = 0
        greatsum = None
        for i in nums:
            if cursum <= 0:
                cursum = i
            else:
                cursum += i
            if cursum > greatsum:
                greatsum = cursum
        return greatsum

看到了大神的代码，直接在原数组上修改，666666

class Solution(object):
    def maxSubArray(self, nums):
        for i in range(1, len(nums)):
            nums[i]= nums[i] + max(nums[i-1], 0)
        return max(nums)

动态规划法

def maxSubArray(self, nums: List[int]) -> int:
        n = len(nums)
        dp = [0] * n
        dp[0] = nums[0]
        for i in range(1, n):
            dp[i] = max(dp[i - 1] + nums[i], nums[i])
        return max(dp)