题目

代码

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

标签：154,nums,int,mid,Solution,II,最小值,findMin
来源： https://blog.csdn.net/qq_40941016/article/details/112432710