子数组最大的和
Given an integer array nums
, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
解法:
首先明确:我们先考虑一个和值sum,sum的大小在不断改变,我们观察sum+nums【i】之后是比nums[i]小了还是大了,要是小了就用nums[i]替换sum;
但是sum是有一个变化值的 他的大小不定 需要有一个max值来不断比较记录下sum的最大值
class Solution {
public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int sum =nums[0];
int max = nums[0];
for(int i=1; i<nums.length; i++){
sum += nums[i];
if(sum <= nums[i])
sum = nums[i];
max = Math.max(sum, max);
}
return max;
}
}