一、分组比较:
分组比较代码实现:
package b_class;
import java.util.Random;
public class FenzuTest {
public static void main(String[] args) {
int[] array = new int[11];
Random r = new Random();
for(int i = 0;i<array.length;i++){
array[i]=r.nextInt(100);
}
for(Integer i:array){
System.out.print(i+" ");
}
findMaxMin(array);
}
private static void findMaxMin(int[] array) {
if(array == null || array.length<=0)
return;
boolean isEven = (array.length % 2 == 0);
if(isEven){ //数组长度为偶数
int[] returnRusult=printMaxMin(array,array.length);
System.out.println("最小值:"+returnRusult[0]+",最大值: "+returnRusult[1]);
}else{
int[] returnResult=printMaxMin(array,array.length-1);//先得到前array.length-1个数的最小值和最大值
int temp=array[array.length-1]; //再拿最后一个值与结果比较
if(temp<returnResult[0])
System.out.println("最小值:"+temp+",最大值:"+returnResult[1]);
else if(temp>returnResult[1])
System.out.println("最小值:"+returnResult[0]+",最大值:"+temp);
else
System.out.println("最小值:"+returnResult[0]+",最大值: "+returnResult[1]);
}
}
private static int[] printMaxMin(int[] array, int length) {
int middle = length/2;
//构建max和min数组,通过两两比较
int[] max=new int[middle];
int[] min=new int[middle];
for(int i=0;i<middle;i++){
if(array[i]>array[i+middle]){
max[i]=array[i];
min[i]=array[i+middle];
}else{
max[i]=array[i+middle];
min[i]=array[i];
}
}
int returnMax = max[0];
for(int k = 1;k<max.length;k++){
if(max[k]>returnMax){
returnMax = max[k];
}
}
System.out.println();
//System.out.println("最大值:"+returnMax);
int returnMin=min[0];
for(int k=1;k<min.length;k++){
if(min[k]<returnMin){
returnMin = min[k];
}
}
int[] returnResult = new int[2];
returnResult[0] = returnMin; //最小值暂时存到returnResult[0]
returnResult[1] = returnMax; //最大值暂时存到returnResult[1]
return returnResult;
//System.out.println("最小值:"+returnMin);
}
}
二、分治方法:
分治代码实现:
package b_class;
import java.util.Random;
public class FenzhiTest {
public static void main(String[] args) {
int[] array = new int[11];
Random r = new Random();
for(int i = 0;i<array.length;i++){
array[i]=r.nextInt(100);
}
for(Integer i:array){
System.out.print(i+" ");
}
System.out.println();
int max =getMax_cd(array,0,array.length-1,-1);
System.out.println("最大值为:"+max);
}
private static int getMax_cd(int[] array, int left, int right, int max) {
if(array == null || array.length == 0){
return 0;
}
if(right-left<=1){
if(array[left]>=array[right]){
max =array[left];
//return max;
}else{
max = array[right];
//return max;
}
}else{
//当比较的数组长度大于2时,需要用分治的方法,把问题变成更小的问题
//直到可以非常简单的 求出结果 max1,max2分别用于记录分治成两个小部分的结果
int max1=Integer.MIN_VALUE;
int max2=Integer.MIN_VALUE;
int middle=(right-left)/2+left;
max1=getMax_cd(array,left,middle,max1);
max2 =getMax_cd(array, middle+1, right, max2);
if(max1>max2){
max=max1;
}else{
max=max2;
}
}
return max;
}
}