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
.
动态规划,到当前index的子串的最大值可能有两种情况:
1. 当前元素的nums[i]
2. nums[i] + 包括了上一个元素nums[i - 1]的最大子串的和
var maxSubArray = function(nums) {
if (nums.length === 0) {
return null;
}
var maxVal = currMax = nums[0];
for (var i = 1; i < nums.length; i++) {
currMax = Math.max(nums[i], currMax + nums[i]);
maxVal = Math.max(currMax, maxVal);
}
return maxVal;
};