[Leetcode]-Maximum Subarray

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.

click to show more practice.

Hide Tags： Divide and Conquer Array Dynamic Programming
Hide Similar Problems ： (M) Maximum Product Subarray
题目：找出 和最大字串
思路：动态规划

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

    return max;
}