Leetcode in C DAY3-Maximum Subarray

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

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.

Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [0]
Output: 0

Example 4:

Input: nums = [-1]
Output: -1

Example 5:

Input: nums = [-2147483647]
Output: -2147483647

Code:

#define MAX(a,b) ((a>b)?a:b)
int maxSubArray(int* nums, int numsSize){
    int l, r,sum=0,max=INT_MIN;
    for(l=0;l<numsSize;l++){
        sum=0;
        for(r=l;r<numsSize;r++){
            sum+=nums[r];
            //printf("l:%dr:%dsum:%d\n",l,r,sum);
            max=MAX(max,sum);
        }
    }
    return max;
 }

Input:

[-2,1,-3,4,-1,2,1,-5,4]

Output:

6