[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.

Solution: Binary search, use while loop here. (Similar to "Find Minimum in Rotated Sorted Array",  )

Running Time: O(logn).

<strong>class Solution:
    # @param num, a list of integer
    # @return an integer
    def findMin(self, num):
        length = len(num)
        left = 0
        right = length-1
        if length==1 or length==2:
            return min(num[left], num[right])
        while(left<right):
            mid = (left+right)/2
            if num[left]<num[right]:
                return num[left]#non-rotation 
            if num[left]<num[mid]:
                left = mid + 1
            elif num[left]==num[mid]:
                left += 1 # right shift the "left" to narrow the range, which can avoid redundant element.
            else:
                right = mid
        return num[left]

思路与上一题类似， 这里用了循环，需要注意的是当num[left] == num[mid]时，需要将left index右移缩小范围，避免重复的元素。