题目:
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.
思路:
Kadane算法,主要想法为分割数组
Code:
public int maxSubArray(int[] A) {
int max= Integer.MIN_VALUE;
int sum=0;
for(int i=0;i<A.length;i++){
sum+=A[i];
if(sum>max) max=sum;
if(sum<0) sum=0;
}
return max;
}
备注:
以上代码前提为至少有一个正整数作为element
如果数组内全为负数,个人认为 max 值为最大的 负数