class Solution {
public int findMin(int[] nums) {
int l = 0, r = nums.length - 1;
//二分找旋转点
while (l < r) {
int mid = l + r + 1 >> 1;
if (nums[mid] >= nums[0]) {
l = mid;
}
else {
r = mid - 1;
}
}
return l == nums.length - 1 ? nums[0] : nums[l + 1];
}
}