leetcode34 Find First and Last Position of Element in Sorted Array

"""
Given an array of integers nums 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].
Example 1:
Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
Example 2:
Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]
"""
"""
我的做法：双指针法
"""
class Solution:
    def searchRange(self, nums, target):
        for i in range(len(nums)):
            if nums[i] == target:
                j = i
                while j < len(nums) and nums[i] == nums[j]:#bug 没有写j<len(nums) 下面j+1会溢出
                    j += 1
                return [i, j-1]
        return [-1, -1]