[Leetcode] 34. Find First and Last Position of Element in Sorted Array

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        left, right = 0, len(nums) - 1

        answer = [-1, -1]
        while left <= right:
            if answer[0] != -1 and answer[1] != -1:
                break
            if target > nums[left]:
                left += 1
            elif target == nums[left]:
                answer[0] = left

            if target < nums[right]:
                right -=1
            elif target == nums[right]:
                answer[1] = right
        return answer