题解 | #在旋转过的有序数组中寻找目标值#

class Solution:
    def search(self , nums: List[int], target: int) -> int:
        # write code here
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = (left + right) // 2
            if(nums[mid] == target):
                return mid;
            elif(target < nums[mid]):
                if(nums[mid] >= nums[left] and nums[left] <= target or nums[mid] < nums[left]):
                    right = mid - 1
                else:
                    left = mid + 1
            else:
                if(nums[mid] <= nums[right] and nums[right] >= target or nums[mid] > nums[left]):
                    left = mid + 1
                else:
                    right = mid - 1
        return -1