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.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

int maxSubArray(int* nums, int numsSize) 
{
    int sum = 0;
    int max = INT_MIN;
    
    for(int i = 0;i < numsSize;i++)
    {
        if(sum >= 0)
            sum = sum +nums[i];
        else 
            sum = nums[i];
        
        if(sum > max)
            max = sum;
        
    }
    
    return max;
}

分治法