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(std::vector<int> &num) {
		if(num.size() == 1) return num[0];
		int left = 0, right = num.size() - 1;
		while (left + 1 < right)
		{
			int mid = left + (right - left) / 2;
			if(num[left] == num[right])
			{
				left++;
			}
			else if(num[left] < num[right])
			{
				return num[left];
			}
			else
			{
				if(num[mid] >= num[left])
				{
					left = mid;
				}
				else
				{
					right = mid;
				}
			}
		}
		return num[left] < num[right] ? num[left] : num[right];
    }
};