LeetCode||81. Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

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

Suppose an array sorted in ascending order 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).

Write a function to determine if a given target is in the array.

The array may contain duplicates.

二分查找，和之前的I相似的做法

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: bool
        """
        left = 0
        right = len(nums) - 1
        while left <= right:
        	mid = (left + right) / 2
        	if nums[mid] == target:
        		return True
        	if nums[mid] == nums[left]:
        		left += 1
        	elif nums[mid] > nums[left]:
        		if nums[mid] > target and nums[left] <= target:
        			right = mid - 1
        		else:
        			left = mid + 1
        	else:
        		if nums[mid] < target and nums[right] >= target:
        			left = mid + 1
        		else:
        			right = mid - 1
        return False