ACM_Someone like you

int maxSubArray(int* nums, int numsSize) {
    int maxSum = 0;       //維護最大連續字段和
    int currentMaxSum = 0;//當前最大和
    int nextNum = 0;
    int singleSum = nums[0]; //存在全是負數，則singleSum 代表最大的那個
    int j = 0;
    for (int i = 0; i < numsSize; i ++) {
        nextNum = nums[i];
        currentMaxSum += nextNum;
        if (currentMaxSum > 0) {
            maxSum = maxSum <= currentMaxSum  ?  currentMaxSum: maxSum;
        } else {
            currentMaxSum = 0;
            j ++;
            singleSum = singleSum < nextNum ? nextNum : singleSum;
        }
    }
    maxSum = (j == numsSize) ? singleSum : maxSum;
    return maxSum;
}