Find Minimum in Rotated Sorted Array II

Medium Find Minimum in Rotated Sorted Array II

37%

Accepted

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.

Have you met this question in a real interview? 

Yes

Example

Given [4,4,5,6,7,0,1,2] return 0

public class Solution {
    /**
     * @param num: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] num) {
        // write your code here
       
        int l = 0, r = num.length-1;
       
        while(l < r){
         if(num[l] < num[r]){
                return num[l];
            }
            int mid = (l+r) / 2;
            if(num[mid] > num[r]){
                l = mid+1;
            } else if(num[mid] < num[l]){
                r = mid;
            } else l++;
        }
       
       
        return num[l];
    }
}