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.

public class Solution {
    public int findMin(int[] num) {
        if(num == null || num.length == 0) return 0;
        int min = Integer.MAX_VALUE;
        int str = 0, end = num.length - 1;
        while(str <= end){
            if(num[str] == num[end]){
                int tmp = num[str];
                min = min > tmp ? tmp : min;
                while(str < end && num[str] == tmp) str ++;
                while(str < end && num[end] == tmp) end --;
            }
            int mid = (str + end) / 2;
            min = min > num[mid] ? num[mid] : min;
            if(num[mid] < num[end]){
                end = mid;
            }else if(num[mid] == num[end]){//from mid to end all the number is same
                end = mid - 1;
            }else{
                str = mid + 1;
            }
        }
        return min;
    }
}