DAY17：leetcode #34 Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

Subscribe to see which companies asked this question

#先二分查找，找到以后线性探测
class Solution(object):
    def searchRange(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (left + right)//2
            if nums[mid] < target:
                left = mid + 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid
                right = mid
                while True:
                    if left >= 0 and nums[left] == target:
                        left -= 1
                    else:
                        left += 1
                        break
                while True:
                    if right < len(nums) and nums[right] == target:
                        right += 1
                    else:
                        right -= 1
                        break
                return [left,right]
        return [-1,-1]