第一道完全自己做的动态规划题,哭了,虽然挺简单的
public int maxSubArray(int[] nums) {
int[] dp = new int[nums.length+1];
for (int i = 0; i < nums.length; i++) {
dp[i] = nums[i];
}
for (int i = 0; i < nums.length-1; i++) {
dp[i+1] = Math.max(dp[i+1], dp[i]+nums[i+1]);
}
int maxx = dp[0];
for (int i = 1; i < nums.length; i++)
maxx = Math.max(maxx, dp[i]);
return maxx;
}