leetcode第53题-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.即找到最大的连续子数列的和！！

代码如下：

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

int maxSubArr(int* nums, int n) 
{
    int i,count=nums[0],tmp=0,tmp1=nums[0],tmp2=0;
	for(i=1;i<n;i++)
	{
		tmp2=tmp1+nums[i];
		tmp=nums[i]>tmp2?nums[i]:tmp2;
		count=count>tmp?count:tmp;
		tmp1=tmp;
	}
	return count;
}

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

int maxArr(int *nums,int n)
{
	int i,count=nums[0],tmp=nums[0];
	for(i=1;i<n;i++)
	{
		tmp=max(nums[i],tmp+nums[i]);
		count=max(count,tmp);
	}
	return count;
}

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
	{
		int *nums=(int *)malloc(sizeof(int)*n);
		for(int i=0;i<n;i++)
			scanf("%d",&nums[i]);
		printf("%d\n",maxSubArr(nums,n));
    }
    return 0;
}

分析：count记录可以返回的最大值，tmp1记录当前序列，tmp2记录加上nums[i]，tmp是tmp1和tmp2的最大值，由代码可知:首先取tmp2和nums[i]的最大值，然后再取一个count和tmp的最大值，再返回count即可！！