```
class Solution(object):
def searchRange(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
res = [-1, -1]
i = 0
j = len(nums) - 1
while i <= j:
mid1 = mid2 = (i+j)/2
if nums[mid1] > target:
j = mid1-1
elif nums[mid1] < target:
i = mid1+1
else:
while i < mid1:
mid = (i+mid1)/2
if nums[mid] != target:
i = mid + 1
else:
mid1 = mid
while j > mid2:
mid = (j+mid2)/2+1
if nums[mid] != target:
j = mid -1
else:
mid2 = mid
return [mid1,mid2]
return res
```