力扣153——寻找旋转排序数组中的最小值（二分，剑指11，力扣154，代码优化）

最新推荐文章于 2022-06-03 23:55:16 发布

玩电脑的象

最新推荐文章于 2022-06-03 23:55:16 发布

阅读量117

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/tianyuzui6/article/details/113006053

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

二分查找，还挺难写的

class Solution {
    public int findMin(int[] nums) {

        if(nums.length ==  1) return nums[0];

        int l = 0;
        int r = nums.length - 1;
        int mid;
        while(l < r){
            mid = (l+r)/2;
            if(nums[l] < nums[mid] && nums[mid] < nums[r])
                return nums[l];
            else if(nums[l] < nums[mid] && nums[mid] > nums[r])
                l = mid;
            else if(nums[l] > nums[mid] && nums[mid] < nums[r])
                r = mid;
            else
                return Math.min(nums[l], nums[r]);
        }
        return -1;
    }
}

优化思路，来自官方题解：

class Solution {
  public int findMin(int[] nums) {
    // If the list has just one element then return that element.
    if (nums.length == 1) {
      return nums[0];
    }

    // initializing left and right pointers.
    int left = 0, right = nums.length - 1;

    // if the last element is greater than the first element then there is no rotation.
    // e.g. 1 < 2 < 3 < 4 < 5 < 7. Already sorted array.
    // Hence the smallest element is first element. A[0]
    if (nums[right] > nums[0]) {
      return nums[0];
    }
    
    // Binary search way
    while (right >= left) {
      // Find the mid element
      int mid = left + (right - left) / 2;

      // if the mid element is greater than its next element then mid+1 element is the smallest
      // This point would be the point of change. From higher to lower value.
      if (nums[mid] > nums[mid + 1]) {
        return nums[mid + 1];
      }

      // if the mid element is lesser than its previous element then mid element is the smallest
      if (nums[mid - 1] > nums[mid]) {
        return nums[mid];
      }

      // if the mid elements value is greater than the 0th element this means
      // the least value is still somewhere to the right as we are still dealing with elements
      // greater than nums[0]
      if (nums[mid] > nums[0]) {
        left = mid + 1;
      } else {
        // if nums[0] is greater than the mid value then this means the smallest value is somewhere to
        // the left
        right = mid - 1;
      }
    }
    return -1;
  }
}

作者：LeetCode
链接：https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/solution/xun-zhao-xuan-zhuan-pai-lie-shu-zu-zhong-de-zui-xi/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。