最大子数组和

#include <stdlib.h>
#include <stdio.h>

#define MAX(a,b) ((a)>(b)?(a):(b))

int maxSubArray1(int *nums,int numsSize)
{
    int pre = 0,maxAns = nums[0];
    for (int i = 0; i < numsSize; i++)
    {
        pre = MAX(pre+nums[i],nums[i]);
        maxAns = MAX(maxAns,pre);
    }
    return maxAns;
    
}

int maxSubArray2(int *nums,int numsSize)
{
    int preSum = 0,maxAns = nums[0];
    for (int i = 0; i < numsSize; i++)
    {
        if (preSum>0)
        {
            preSum +=nums[i];
            // maxAns = MAX(preSum,maxAns);
            // printf(" i:%d - preSum:%d - maxAns:%d \n",i,preSum,maxAns);
        }
        else
        {
            preSum = nums[i];
            // maxAns = MAX(preSum,maxAns);
            // printf(" i:%d - preSum:%d - maxAns:%d \n",i,preSum,maxAns);
        }
        maxAns = MAX(preSum,maxAns);
        printf(" i:%d - preSum:%d - maxAns:%d \n",i,preSum,maxAns);
    }
    return maxAns;    
}

int main(int *argc,char *argv[])
{
    int array[]={-2,1,-3,4,-1,2,1,-5,4};
    int temp=0;
    temp=maxSubArray2(array,sizeof(array)/sizeof(int));
    printf("temp:%d\n",temp);
}