求数组中连续最大和

java代码献上，献丑了....

大概就是用了下分治算法，具体可以去google

package lengyu.biggestSeriesArrays;

public class Test {

public static int getB( int[] range , int start , int end){

 

if(start==end){

return range[start];

}

if(end-start==1){

int sum = 0;

int sumall = 0;

sum+=range[start];

sumall+=range[start];

sum+=range[end];

if(sum>sumall)

sumall = sum;

if(range[end]>sum){

sum = range[end];

}

return range[start];

}

int mid = (start+end)/2;

int leftsum = 0; 

int sum = 0;

for(int i = start;i

if(i == start){

leftsum += range[i];

sum += range[i];

}

else{

sum +=range[i];

if(sum>leftsum){

leftsum = sum;

}

}

}

int rightsum = 0;

sum = 0;

for(int i = mid;i<=end;i++){

if(i == start){

rightsum += range[i];

sum += range[i];

}

else{

sum +=range[i];

if(sum>leftsum){

rightsum = sum;

}

}

}

sum = rightsum+leftsum;

int suml = getB( range , start , mid-1);

int sumr = getB( range , mid+1 , end);

if(suml>sum){

return suml;

}

else if(sumr>sum){

return sumr;

}

else{

return sum;

}

}

public static void main(String[] args) {

Test t = new Test();

try {

Object t2 = t.clone();

System.out.println(t==t2);

} catch (CloneNotSupportedExcepti on e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

}

}