leetcode Find Minimum in Rotated Sorted Array II

class Solution {
public:
    int findMin(vector<int> &num)
    {
        int len = num.size(), left = 0, right = len - 1, mid = (left + right ) / 2, minmum = INT_MAX;
        while(left != right)
        {
            mid = (left + right) / 2;
            if (num[mid] == num[left])
            {
                if (mid == left)
                {
                    if (num[left] > num[right])
                        left = right;
                    break;
                }
                left++; // 这里和上题不一样
            }
            else if (num[mid] > num[left])
            {
                if (num[left] < minmum) minmum = num[left];
                left = mid + 1;
            }
            else if (num[mid] < num[left])
            {
                if (num[mid] < minmum) minmum = num[mid];
                right = mid - 1;
            }
        }
        minmum = min(minmum, num[left]);
        return minmum;
    }
};