53. 最大子序和
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
给定一个序列(至少含有 1 个数),从该序列中寻找一个连续的子序列,使得子序列的和最大。
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.
click to show more practice.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
若你已实现复杂度为 O(n) 的解法,尝试使用更为精妙的分治法求解。
Solution
时间复杂度为O(n),每一步可以选择加上下一个数,或者重新开始计数,用maxSum
记录所有步数的最大值,用preMax
记录每一步决策的最大值
public class Solution {
public int MaxSubArray(int[] nums) {
if(nums == null || nums.Length == 0){
return 0;
}
var maxSum = nums[0];
var preMax = nums[0];
var length = nums.Length;
for(int i = 1; i < length; i++){
var tempSum = nums[i] + preMax;
if(tempSum < nums[i]){
preMax = nums[i];
}else{
preMax = tempSum;
}
if(preMax > maxSum){
maxSum = preMax;
}
}
return maxSum;
}
}