class Solution:
def maxSubArray(self, nums: List[int]) -> int:
dp = nums[0]
max = nums[0]
for i in range(1,len(nums)):
if dp<0:
dp=nums[i]
else:
dp+=nums[i]
if(dp>max):
max=dp
return max
利用动态规划的思想