题目：
代码如下：
class Solution: def maxSubArray(self, nums: ‘List[int]‘) -> ‘int‘: n = len(nums) max_sum = nums[0] for i in range(1, n): if nums[i - 1] > 0: nums[i] += nums[i - 1] max_sum = max(nums[i], max_sum) return max_sum
原文：https://www.cnblogs.com/tsdblogs/p/12354315.html