求最大子序列
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.
解法1:动态规划
如果前i-1个数之和<0,那么加上第i个数肯定要比第i个数小,【sum = Math.max(nums[i], sum + nums[i]);】那么就从第i个数重新开始找。【sum = Math.max(nums[i], sum + nums[i]);】
class Solution {
public static int maxSubArray(int[] nums) {
int size = nums.length;
int Sum = nums[0];
int sum = nums[0];
for(int i = 1;i < size ;++i){
sum = Math.max(nums[i], sum + nums[i]);
Sum = Math.max(sum, Sum);
}
return Sum;
}
}