153

class Solution {
public:
    int findMin(vector<int>& nums) {
        if(nums.size()==1) return nums[0];
        int n = nums.size();
        if(nums[0] < nums[n-1]) return nums[0];

        int left = 1, right = n;
        while(left<right){
            int mid = (left+right)/2;
            if(nums[mid] > nums[0])
                left = mid+1;
            else right = mid;
        }
        return nums[left];
    }
};