题目 https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/solution/xun-zhao-xuan-zhuan-pai-xu-shu-zu-zhong-de-zui–16/ 题目 class Solution { public int findMin(int[] nums) { int low=0; int high=nums.length-1; while(low<high){ int p=(high-low)/2+low; if(nums[p]==nums[high]){ high--; } else if(nums[p]>nums[high]){ low=p+1; } else{ high=p; } } return nums[low]; } } 复杂度