Find Minimum in Rotated Sorted Array II

class Solution {public:    int findMin(vector<int>& nums) {        //if(nums.size() == 0)return INT_MIN;        int i = 0, j = nums.size()-1;        //与https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/不同之处在于加了下面这个顺序执行的一段代码。        if(nums[i] <= nums[j]) //顺序循环        {            while(i < j)            {                if(nums[i] < nums[j])                    break;                i++;            }            return nums[i];        }                int mid = (i+j)/2;        while(i < j)        {            if(i == mid)            {                mid = mid+1;                break;            }            if(nums[mid] >= nums[i])                i = mid;            else                j = mid;                        mid = (i+j)/2;        }        return nums[mid];    }};