Leetcode 刷题

寻找旋转排序数组中的最小值 II

  • 难度:困难?(真的吗)

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