53. 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.

 

int maxSubArray(int* nums, int numsSize) {
    int sum = 0;
    int sum_max = INT_MIN;
    int i;
    for(i = 0; i < numsSize; i++)
    {
        if(sum < 0)                //如果sum小于0 ，就舍弃
            sum = 0;
        sum += nums[i];            
        if(sum > sum_max)
            sum_max = sum;
    }
    return sum_max;
}