Leetcode

81.searchInARotatedArray2.py

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        l, r = 0, len(nums) - 1

        while l <= r:
            while r >= l and r > 0 and nums[r] == nums[r - 1]:
                r -= 1
            while l <= r and l < len(nums) - 1 and nums[l] == nums[l + 1]:
                l += 1
            m = (l + r) // 2
            if nums[m] == target:
                return True

            if nums[l] <= nums[m]:
                if nums[l] <= target < nums[m]:
                    r = m - 1
                else:
                    l = m + 1
            else:
                if nums[m] < target <= nums[r]:
                    l = m + 1
                else:
                    r = m - 1

        return False

This site is open source. Improve this page.