Question:
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4]
,
the contiguous subarray [4,-1,2,1]
has the largest sum = 6
.
public class Solution {
public int maxSubArray(int[] nums) {
int n=nums.length;
int[] dp=new int[n];
dp[0]=nums[0];
int max=dp[0];
for(int i=1;i<=n-1;i++)
{
dp[i]=nums[i]+(dp[i-1]>0?dp[i-1]:0);
max=Math.max(max,dp[i]);
}
return max;
}
}
动规感觉明白点时什么玩意了,The next solution always related on the previous one