【python/M/34】Find First and Last Position of Element in Sorted Array

题目

这道题好像改过名字，原来应该叫Search for a Range（搜索范围）吧

基本思路

看到O(logn)的时间复杂度的查找，就首先想到二分查找，刚好这道题中数字是升序的，所以可以直接拿来用，但是我们要进行一点点小修改。当我们使用传统二分查找思路找到和target相等的值的索引的时候，我们继续分头向前向后循环，直到找到不等于target的值，此时就能找到我们需要的索引对。

代码

class Solution:
    def searchRange(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        length = len(nums)
        if length == 0:
            return [-1,-1]
        if nums[0] <= target and nums[-1] >= target:
            left,right = 0,length-1

            while left <= right:
                mid = (left+right) // 2

                if nums[mid] == target:
                    right = left = mid

                    while left-1 >= 0 and nums[left-1] == target:
                        left -= 1
                    while right+1 <= length-1 and nums[right+1] == target:
                        right += 1
                    return [left,right]

                elif nums[mid] < target:
                    left = mid + 1
                else:
                    right = mid - 1

        return [-1,-1]

运行结果

88 / 88 test cases passed.
Status: Accepted
Runtime: 40 ms