https://www.bilibili.com/video/BV1ML4y1h7S8?spm_id_from=333.999.0.0
class Solution {
public int maxSubArray(int[] nums) {
int[] dp=new int[nums.length];
dp[0]=nums[0];
int max=dp[0];
for(int i=1;i<nums.length;i++){
if(dp[i-1]>0){
dp[i]=dp[i-1]+nums[i];
}else{
dp[i]=nums[i];
}
if(max<dp[i]){
max=dp[i];
}
}
return max;
}
}