剑指Offer29 连续子数组最大和

/*************************************************************************
    > File Name: 29_GreatestSumOfSubArray.c
    > Author: Juntaran
    > Mail: JuntaranMail@gmail.com
    > Created Time: 2016年09月01日 星期四 20时37分22秒
 ************************************************************************/

#include <stdio.h>

int FindGreatestSumOfSubArray(int* nums, int length)
{
    if (nums==NULL || length<=0)
    {
        printf("error
");
        return -1;
    }
    
    int CurSum = 0;
    int MaxSum = 0;
    
    for (int i = 0; i < length; ++i)
    {
        if (CurSum <= 0)
            CurSum = nums[i];
        else
            CurSum += nums[i];
        
        if (CurSum > MaxSum)
            MaxSum = CurSum;
    }
    printf("MaxSum is %d
", MaxSum);
    return MaxSum;
}

int main()
{
    int nums[] = {1,-2,3,10,-4,7,2,-5};
    int length = 8;
    FindGreatestSumOfSubArray(nums, length);
}