53. 最大子数组之和（DP）Maximum Subarray

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.

click to show more practice.

Subscribe to see which companies asked this question.

求出最大子数组之和

public class Solution {
    public int MaxSubArray(int[] nums) {
        if (nums.Length == 0)
        {
            return 0;
        }
        int max = nums[0],sum = 0;
        for (int i = 0; i < nums.Length; i++)
        {
            if (sum < 0)
            {
                sum = nums[i];
            }
            else
            {
                sum += nums[i];
            }
            if (sum > max)
            {
                max = sum;
            }
        }
        return max;
    }
}

null