[LeetCode][JavaScript]Find Minimum in Rotated Sorted Array II

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.

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/

---

接着上一题 Find Minimum in Rotated Sorted Array

还是二分查找，加上寻找重复数字的代码，最坏情况下的复杂度是O(n).

/**
 * @param {number[]} nums
 * @return {number}
 */
var findMin = function(nums) {
    var start = 0, end = nums.length - 1, middle;
    while(start < end){        
        if(nums[start] < nums[end])
            return nums[start];
        while(nums[start] === nums[start + 1])
            start++;
        while(nums[end] === nums[end - 1])
            end--;
        middle = (start + end) >> 1;
        if(nums[start] <= nums[middle])
            start = middle + 1;
        else 
            end = middle;
    }
    return nums[start];
};