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
.
=============================================================
有时得承认,自己真的很菜。
刚开始拿到题的时候,直接就写了一个三层for,提交后,超时
后来写了一个双层for,感觉差不多,确实可以运行出来,代码如下:
public class Solution {
public int maxSubArray(int[] A) {
if(A.length==0)return 0;
int total = A[0];int sum = A[0] ;
for(int i=0;i
total)total=sum;
if(sum<0)break;
}
}
return total;
}
}
习惯性的写完百度一下,发现到处都是O(n)的解法,有点惭愧了
public class Solution {
public int maxSubArray(int[] A) {
int i=0;
if(A.length==0)return 0;
int total = A[0];int sum = A[0] ;
for(i = 1;i
开始想不通sum小于0的时候为什么直接丢弃,后来想到一个例子{-1,4,3}
sum开始等于-1,加上4的时候,自己是负数,所以还不如直接丢弃