用分治算法同时求数组中的最值

最新推荐文章于 2020-10-26 16:15:45 发布

淡然之静美

最新推荐文章于 2020-10-26 16:15:45 发布

阅读量476

点赞数

分类专栏： java

本文链接：https://blog.csdn.net/u010506130/article/details/46955809

版权

java 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

//根据别人的最大值代码改写分治法求数组的最大值最小值
public class MaxAndMin {

     public static void main(String[] args){

        int AR[] = { 0,3, 4, 62, 70, 23, 120, 34, 800,-1};
        int[] res=maxandminNum(AR,0,(AR.length-1));
        System.out.println("MAX: "+res[0]+",MIN: "+res[1]);
     }

   public static int[] maxandminNum(int arrary[],int left,int right)
   {
      int maxLeft,maxRight;
      int[] leftres=new int[2];//左边的最值
      int[] rightres=new int[2];//右边子模块的最值
      if(left == right)
      {
       leftres[0]=leftres[1]=rightres[0]=rightres[1]=left;//下标为0代表最大值，下标为1代表最小值
       return leftres;
      }
      leftres = maxandminNum(arrary,left,(left+right)/2);
      rightres = maxandminNum(arrary,(left+right)/2 + 1,right);
      System.out.println(leftres[0]+","+ leftres[1]+","+rightres[0]+","+rightres[1]);
      if(arrary[leftres[0]] > arrary[rightres[0]]&&arrary[leftres[1]] < arrary[rightres[1]]) ;
      if(arrary[leftres[0]] > arrary[rightres[0]]&&arrary[leftres[1]] > arrary[rightres[1]]) leftres[1]=rightres[1];
      if(arrary[leftres[0]] < arrary[rightres[0]]&&arrary[leftres[1]] > arrary[rightres[1]]) leftres=rightres;
      if(arrary[leftres[0]] < arrary[rightres[0]]&&arrary[leftres[1]] < arrary[rightres[1]]) leftres[0]=rightres[0];
      System.out.println(leftres[0]+","+ leftres[1]+","+rightres[0]+","+rightres[1]);
      return leftres;
   }

}