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

    int start_v = nums[0];
    int min_v = start_v;
    for(int i=0;i<int(nums.size()-1);i++)
    {
        //旋转开始元素
        int nv = nums[i];
        int n1v = nums[i+1];
        if (nv>n1v)
        {
            if(n1v<start_v)
            {
                min_v = n1v;
                break;
            }
        }
    }
    return min_v;

}

};