Leetcode 81 Search in Rotated Sorted Array II

There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).

Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], …, nums[n-1], nums[0], nums[1], …, nums[k-1]] (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot index 5 and become [4,5,6,6,7,0,1,2,4,4].

Given the array nums after the rotation and an integer target, return true if target is in nums, or false if it is not in nums.

You must decrease the overall operation steps as much as possible.

Input: nums = [2,5,6,0,0,1,2], target = 0
Output: true

Input: nums = [2,5,6,0,0,1,2], target = 3
Output: false

• Soruda bize liste veriliyor.Bu listedeki sayılar küçükten büyüğe sıralı iken n defa kaydırılmış olsun.Ayrıca bu listede aynı sayıdan birden fazla olabilir.Böyle bir listede bize verilen sayı var ise True bulunmuyor ise False dönmemiz isteniyor.

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