leetcode -- Search for a Range -- 思路简单，要再做一遍

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:
right = mid - 1
elif nums[mid] < target:
left = mid + 1
else:
list = [0, 0]
#这里注意加上下面这两句，对应的case是[2,2],target = 2
if nums[left] == target: list[0] = left
if nums[right] == target: list[1] = right
for i in range(mid, right+1):
if nums[i] != target: list[1] = i - 1; break
for i in range(mid, left-1, -1):
if nums[i] != target: list[0] = i + 1; break
return list
return [-1, -1]