LeetCode 34. Search for a Range （Python）

题目描述：
Given an array of integers sorted in ascending order, 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].

思路：
要求logn的复杂度那么首先想到的就是二分查找，在找到一个相等点后再分别找到左右边界的索引值返回（更好的操作是在查找左右边界的时候也用二分查找）

AC代码：

class Solution(object):
    def searchRange(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        l, r = 0, len(nums) - 1
        isA = True
        while l <= r:
            m = (l + r) // 2
            if nums[m] > target:
                r = m - 1
            elif nums[m] < target:
                l = m + 1
            else:
                l, r = m, m
                # 找到左右边界
                while target == nums[l - 1] and l > 0:
                    l -= 1
                while r < len(nums) - 1 and target == nums[r + 1]:
                    r += 1
                isA = False
                break
        if isA is True:
            return [-1, -1]
        else:
            return [l, r]