Find minimum in rotated sorted array II

Follow upFor "find minimum in rotated sorted array ":
What ifDuplicatesAre allowed?

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

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

(I. e .,0 1 2 4 5 6 7Might become4 5 6 7 0 1 2).

Find the minimum element.

The array may contain in duplicates.

Answer

public class Solution {    int []num;    public int findMin(int start,int end)    {        if(start==end)        {            return num[start];        }        if(num[start]==num[end])        {            return findMin(start+1,end);        }        int middle=start+((end-start)>>1);        if(num[middle]>num[end])        {            return findMin(middle+1,end);        }        return findMin(start,middle);    }    public int findMin(int[] num) {        this.num=num;        return findMin(0,num.length-1);    }}

Arraybinary search

Find minimum in rotated sorted array II