java:小小动态规划一下子
class Solution {
public int maxSubArray(int[] nums) {
int ans=nums[0];
int sum=0;
for(int num:nums){
if(sum>0){
sum += num;
}else{
sum=num;
}
ans=Math.max(ans,sum);
}
return ans;
}
}
python3:
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
ans=[nums[0]]
for i in range(1,len(nums)):
ans.append(max(ans[i-1]+nums[i],nums[i]))
return max(ans)