153.寻找旋转排序数组中的最小值.java

/*
 * @lc app=leetcode.cn id=153 lang=java
 *
 * [153] 寻找旋转排序数组中的最小值
 */

// @lc code=start
class Solution {
    public int findMin(int[] nums) {

        int l = 0, r = nums.length - 1;

        while (l < r) {
            int mid = l + r  >> 1;
            if (nums[mid] <= nums[r]) r = mid;
            else l = mid + 1;
        }
        return nums[l];
    }
}
// @lc code=end