题目链接:https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/
题目如下:
class Solution {
public int findMin(int[] nums) {
int low,high,mid;
low=0;high=nums.length-1;
while(low<high){
mid=(low+high)/2;
if(nums[mid]<nums[high]) high=mid;
else if(nums[mid]>nums[high]) low=mid+1;
//1、升序排列即从小到大排序 2、存在相同的元素
else if(nums[mid]==nums[high]) high=high-1;
}
return nums[low];
}
}