public class MaxSubArray {
public static void main(String[] args) {
int[] arr = {-2,1,-3,4,-1,2,1,-5,4};
int[] arr1={-1,2,3,50,-16,1,20,-12};
maxarr(arr1);
}
public static void maxarr(int[]arr){
int maxsum=0;
int sum = 0;
for(int i=0;i<arr.length;i++){
sum+=arr[i];
if(sum>maxsum){
maxsum = sum;}
if (sum<0) {
sum = 0;
}
}
System.out.println(maxsum);
}
}
时间复杂度:O(N)