剑指offer_数组_连续子数组的最大和

数组_连续子数组的最大和

正确解法：动态规划，将现有问题转化为已解决的问题，可以通过空间拓展实现。

class Solution:
    def FindGreatestSumOfSubArray(self , array: List[int]) -> int:
        # write code here
        length = len(array)
        dp = [0 for i in range(length)]
        dp[0] = array[0]
        for j in range(1, length):
            dp[j] = max(array[j], array[j]+dp[j-1])
        return max(dp)
            

#
# 
# @param A int整型一维数组 
# @return int整型
#
class Solution:
    def maxSubArray(self , A ):
        # write code here
        maxsum = A[0]
        tmp = 0
        for num in A:
            tmp += num
            if tmp > maxsum:
                maxsum = tmp
            if tmp < 0:
                tmp = 0
        return maxsum

# -*- coding:utf-8 -*-
class Solution:
    def FindGreatestSumOfSubArray(self, array):
        # write code here
        max_sum = array[0]
        pre_sum = 0
        for a in array:
            if pre_sum < 0:
                pre_sum = a
            else:
                pre_sum += a
            max_sum = max(max_sum, pre_sum)
        return max_sum
                

方法2：

# -*- coding:utf-8 -*-
class Solution:
    def FindGreatestSumOfSubArray(self, array):
        # write code here
        left = 0
        right = left
        maxsum = array[0]
        while left <= len(array)-1 and right <= len(array)-1:
            if sum(array[left:right+1])<=0:
                left = right+1
                right = left
                if left <= len(array)-1:
                    maxsum = max(maxsum, array[left])
            else:
                maxsum = max(maxsum, sum(array[left:right+1]))
                right += 1
        return maxsum