LeetCode.No.33 搜索螺旋排序数组

使用二分法

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = (left + right) // 2
            if nums[mid] == target:
                return mid
            if nums[mid] >= nums[0]:
                if nums[0] <= target < nums[mid]: #注意判断条件是>nums[0]而不是nums[left]
                    right = mid - 1
                else:
                    left = mid + 1
            else:
                if nums[mid] < target <= nums[-1]:
                    left = mid + 1
                else:
                    right = mid - 1
        return -1
        '''
        for idx, val in enumerate(nums):
            if val == target:
                return idx
        return -1
        '''