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
.
题意:给出一数组,求最大子数组和(要求至少取一个元素)
思路:用动态规划方法,用dp(i)表示从0到i之间的最大子数组和,状态转移方程为dp(i)=dp(i-1) > 0 ? dp(i-1)+a[i] : a[i]
代码如下:
class Solution {
public int maxSubArray(int[] nums)
{
int max = Integer.MIN_VALUE;
int sum = 0;
int len = nums.length;
for (int i = 0; i < len; i++)
{
if (sum > 0) sum += nums[i];
else sum = nums[i];
max = Math.max(max, sum);
}
return max;
}
}