```
class Solution {
public:
int findMin(vector<int>& nums) {
int l = 0, r = nums.size() - 1;
while(l < r){
int mid = l + (r - l)/2;
nums[mid] > nums[r] ? l = mid + 1 : r = mid;
}
return nums[r];
}
};
```