```
class Solution {
public int findMin(int[] nums) {
if (nums == null || nums.length == 0) return -1;
int start = 0;
int end = nums.length - 1;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (nums[mid] == nums[end]) end--;
else if (nums[mid] < nums[end]) end = mid;
else start = mid;
}
if (nums[start] < nums[end]) return nums[start];
return nums[end];
}
}
```