class Solution:
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: bool
"""
pol = len(nums)-1
while pol>0 and nums[pol] >= nums[pol-1]:
pol-=1
ans = self.index_serach(target,nums[:pol])
if ans == -1:
ans = self.index_serach(target,nums[pol:])
if ans != -1:
return True
else:
return False
else:
return True
def index_serach(self,target,nums):
l,r = 0,len(nums)-1
index = -1
while l<=r:
mid = (l+r)//2
if nums[mid] < target:
l = mid+1
elif nums[mid] > target:
r = mid-1
else:
index = mid
break
return index
07-19
07-19
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交