34.ソート配列の要素の最初と最後の位置を検索します。

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
       # if target>nums[-1] or target<nums[0]:
          #  return [-1,-1]
        #ans=[]
        left=None
        right=None
        for i,v in enumerate(nums):
            if left==None and v==target:
                left=i
            elif left!=None and v==target:
                right=i
            else:
                continue

        if left==None:
            left=right=-1
        elif not right and left>=0:
            right=left
        return [left,right]