https://leetcode-cn.com/problems/maximum-subarray/
class Solution {
public int maxSubArray(int[] nums) {
int[] dp=new int[nums.length];
dp[0]=nums[0];
for (int i=1;i<dp.length;i++){
if (dp[i-1]+nums[i]>nums[i]){
dp[i]=nums[i]+dp[i-1];
}else {
dp[i]=nums[i];
}
}
int max=dp[0];
for (int i=1;i<dp.length;i++){
if (dp[i]>max){
max=dp[i];
}
}
return max;
}
}