81. 搜索旋转排序数组 II

爱吃鱼的小刘

于 2018-12-09 16:15:09 发布

阅读量82

点赞数

本文链接：https://blog.youkuaiyun.com/qq_38484259/article/details/84928999

版权

在这里插入图片描述

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