leetcode81 search in Rotate Array

没重复数字

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        left,right=0,len(nums)-1
        while left<=right:
            
            mid=(left+right)//2
            print(nums[left],nums[right],nums[mid])
            if nums[mid]<target:
                if nums[right]>target:
                    left=mid+1
                elif nums[right]<target:
                    if nums[mid]<nums[right]:
                        right=mid-1
                    else:
                        left=mid+1
                    
                else:
                    return True
            elif nums[mid]>target:
                if nums[right]>target:
                    if nums[right]>nums[mid]:
                        right=mid-1
                    else:
                        left=mid+1
                   
                elif nums[right]<target:
                    right=mid-1
                else:
                    return True
            else:
                return True
        return False

有重复数字

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        left,right=0,len(nums)-1
        while left<=right:
            
            mid=(left+right)//2
            print(nums[left],nums[right],nums[mid])
            if nums[mid]<target:
                if nums[right]>target:
                    left=mid+1
                elif nums[right]<target:
                    if nums[mid]<nums[right]:
                        right=mid-1
                    elif nums[mid]>nums[right]:
                        left=mid+1
                    else:
                        right-=1
                else:
                    return True
            elif nums[mid]>target:
                if nums[right]>target:
                    if nums[right]>nums[mid]:
                        right=mid-1
                    elif nums[right]<nums[mid]:
                        left=mid+1
                    else:
                        right-=1
                elif nums[right]<target:
                    right=mid-1
                else:
                    return True
            else:
                return True
        return False

两者的区别在于如果有重复数字的话，如果mid处的数字正好等于right处的数字，那么可能在mid的左边也可能在mid的右边，但是right肯定不是了，right-=1