53. Maximum Subarray

大大萝卜头cc

于 2017-03-15 21:54:11 发布

阅读量164

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_28050195/article/details/62238279

版权

LeetCode 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

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.

 public static int maxSubArray(int[] nums) 
	            {
	            	int[] sum=new int[nums.length];
	            	sum[0]=nums[0];
	            	int max=nums[0];
	            	for(int i=1;i<nums.length;i++)
	            	{
	            		sum[i]=Math.max(nums[i], sum[i-1]+nums[i]);
	            		max=Math.max(max, sum[i]);		
	            	}
	            	return max;	   	            
      }