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
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array
主要是先考虑二分在哪个方向,其次要考虑等于号在哪个方向取。class Solution(object):
def search(self, nums, target):
start=0
end=len(nums)-1
if len(nums)==1 and nums[0]==target:
return 0
else:
while start<=end:
mid = (start + end) / 2
if nums[mid]==target:
return mid
else:
if nums[mid]<nums[end]:
if target<=nums[end] and target>nums[mid]:
start=mid+1
else:
end=mid-1
else:
if target>=nums[start] and target<nums[mid]:
end=mid-1
else:
start=mid+1
return -1