LeetCode刷题（46）--Search in Rotated Array

特别处理等于的情况

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