"""

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

If target is not found in the array, return [-1, -1].

You must write an algorithm with O(log n) runtime complexity.

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]

Example 3:

Input: nums = [], target = 0

Output: [-1,-1]

Constraints:

0 <= nums.length <= 105

-109 <= nums[i] <= 109

nums is a non-decreasing array.

-109 <= target <= 109

"""

class Solution:

def searchRange(self, nums: List[int], target: int) -> List[int]:

if not nums:

return [-1,-1]

left, right = 0, len(nums)-1

while left <= right:

mid = (left+right)//2

if nums[mid] == target:

left, right = mid, mid

while left-1 >= 0 and nums[left-1] == target:

left -= 1

while right+1 <= len(nums)-1 and nums[right+1] == target:

right += 1

return [left, right]

elif nums[mid] < target:

left = mid+1

else:

right = mid-1

return [-1,-1]