题解 | #连续子数组的最大和#
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
class Solution:
def FindGreatestSumOfSubArray(self , array: List[int]) -> int:
dp = [0 for _ in range(len(array))]
dp[0] = array[0]
for i in range(1, len(array)):
dp[i] = max(dp[i-1]+array[i], array[i])
return max(dp)
查看14道真题和解析