33. 搜索旋转排序数组

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        l=0
        r=len(nums)-1
        while l<r:
            mid =r+l>>1
            if nums[mid]<nums[r]: #哪边有序先看哪边
                if nums[mid]<target<=nums[r]:# 向l=mid+1靠
                    l=mid+1
                else:
                    r=mid
            else:
                if nums[l]<=target<=nums[mid]:
                    r=mid
                else:
                    l=mid+1
        if target==nums[l]:
            return l
        else:
            return -1