最大子序和#53

输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大，为 6。

//C style
int max(int a,int b){
    return a>b?a:b;
}

int maxSubArray(int* nums, int numsSize) {
    int sum=0;
    int m=-2147483647;
    
    for(int i=0;i<numsSize;i++){
       sum=max(sum+nums[i],nums[i]);
       m=max(sum,m);
    }
    return m;
}

int maxSubArray(int* nums, int numsSize) {
    int maxsum=nums[0],subsum=nums[0],i;
    for(i=1;i<numsSize;i++)
    {
        if(subsum<0)
            subsum=nums[i];
        else
            subsum+=nums[i];
        if(subsum>maxsum)
            maxsum=subsum;
    }
    return maxsum;
}

5

"111221"