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