LeetCode: Find Minimum in Rotated Sorted Array II

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

The array may contain duplicates.

class Solution {
public:
    int findMin(vector<int> &num) {
        int left = 0, right = num.size()-1, min = INT_MAX;
        while(left <= right)
        {
            int mid = (left + right)/2;
            if(num[mid] < min)
                min = num[mid];
            if(num[mid] < num[right])
                right = mid - 1;
            else if(num[mid] > num[right])
                left = mid + 1;
            else
                right--;
        }
        return min;
        
    }
};