leetcode: 81. Search in Rotated Sorted Array II

Problem

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

AC

class Solution():
def search(self, nums, target):
left, right = 0, len(nums) - 1
while left <= right:
mid = (left + right) // 2
if nums[mid] == target:
return True
elif nums[mid] == nums[left]:
left += 1
elif (nums[mid] > nums[left] and nums[left] <= target < nums[mid]) or \
(nums[mid] < nums[left] and not (nums[mid] < target <= nums[right])):
right = mid - 1
else:
left = mid + 1
return False

if __name__ == "__main__":
assert Solution().search([3, 5, 1], 3) == True
assert Solution().search([2, 2, 3, 3, 4, 1], 1) == True
assert Solution().search([4, 4, 5, 6, 7, 0,
4000
1, 2], 5) == True