I read some of the top voted answers, all of them are kind of binary search. You must think it too hard, here is my easy solution, takes only 8ms of the OJ.

```
class Solution {
public:
int findMin(vector<int>& nums) {
if(nums.size() == 0)
return -1;
int m = nums[0];
int i=1;
for(; i<nums.size(); i++){
if(nums[i] < m){
m = nums[i];
break;
}
}
return m;
}
};
```