//逻辑是否可以再清晰些。
public class Solution {
public int findMin(int[] nums) {
if (nums == null || nums.length == 0) {
return Integer.MIN_VALUE;
}
int left = 0;
int right = nums.length - 1;
while (left < right) {
if (nums[left] < nums[right]) {
return nums[left];
}
int mid = left + (right - left) / 2;
if (mid != 0 && nums[mid] < nums[mid - 1]) {
return nums[mid];
}
if (nums[mid] >= nums[left]) {
left = mid + 1;
} else {
right = mid;
}
}
return nums[left];
}
}