81.py

'''
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

 (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).

 You are given a target value to search. If found in the array return true, otherwise return false.

 Example 1:

 Input: nums = [2,5,6,0,0,1,2], target = 0
 Output: true
 Example 2:

 Input: nums = [2,5,6,0,0,1,2], target = 3
 Output: false
'''

classSolution(object):
defsearch(self, nums, target):
"""
 :type nums: List[int]
 :type target: int
 :rtype: bool
 """
left, right=0, len(nums) -1
whileleft<=right: 
mid= (left+right) /2
ifnums[mid] ==target:
returnTrue
ifnums[left] <nums[mid]:
ifnums[left] <=target<nums[mid]:
right=mid-1
else:
left=mid+1
elifnums[mid] <nums[left]:
ifnums[mid] <target<=nums[right]:
left=mid+1
else:
right=mid-1
else:
left+=1

returnFalse