LeetCode 53: Maximum Subarray

Array LeetCode

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.

Code

int maxSubArray(int* nums, int numsSize) {
    int move = 0;
    int sum = 0;
    int res = nums[0];
    for (int i = 0; i < numsSize; i++) {
        if (sum < 0) {
            sum = 0;
        }
        sum += nums[i];
        if (res <= sum) {
            res = sum;
        }
    }
    return res;
}