在有序旋转数组中找到最小值

左手的ㄟ右手 2022-05-27 10:11 217阅读 0赞

![这里写图片描述][70]

//在有序旋转数组中找到最小值
    public class GetArrMin{ 
    
         //获得旋转数组中的最小值(利用二分查找的思想)
         public static int getMin(int[]arr)
         {
            int low=0;
            int high=arr.length-1;
            int mid=0;
            while(low<high)
            {
                  if(low==high-1)
                  {
                    break;
                  }
                  if(arr[low]<arr[high])
                  {
                     return arr[low];
                  }
                  mid=(low+high)/2;
                  if(arr[low]>arr[mid])
                  {
                     high=mid;
                     continue;
                  }
                  if(arr[mid]>arr[high])
                  {
                    low=mid;
                    continue;
                  }
                  while(low<mid)
                  {
                       if(arr[low]==arr[mid])
                       {
                         low++;
                       }
                       else if(arr[low]<arr[mid])
                       {
                          return arr[low];
                       }else{
    
                           high=mid;
                           break;
                       }
    
                  }
            }
            return Math.min(arr[low],arr[high]);
         } 
    
         public static void main(String[]args)
         {
    
            //System.out.println("Hello");
            int[]test={
       4,4,5,1,2,3};
            System.out.println(getMin(test));
    
         }
    }

![这里写图片描述][70 1]

[70]: /images/20220527/388c701eb2ef4402b1aa5991572afe55.png
[70 1]: /images/20220527/aaf0a33ed292485f99fde860e2afa8e8.png