https://leetcode.com/problems/search-for-a-range/
二分就能做
图方便用了list.index(target) list.count(target)
如果index没有找到会抛出异常 用了try
class Solution:
# @param {integer[]} nums
# @param {integer} target
# @return {integer[]}
def searchRange(self, nums, target):
try:
startindex=nums.index(target)
except:
startindex=-1
times=nums.count(target)
if startindex==-1:
sol=[-1,-1]
else:
sol=[startindex,startindex+times-1]
return sol