```
public int findMin(int[] nums) {
int min = nums[0], cur = nums[nums.length-1];
if (min > cur) {
for (int i = nums.length - 1; i > 0; i--) {
cur = nums[i];
if (cur <= min) {
min = cur;
} else {
break;
}
}
}
return min;
}
```