#34. Find First and Last Position of Element in Sorted Array

Given an array of integers nums sorted in non decreasing 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.

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

        first = -1

        last = -1

        for i in range(0, len(nums)):

            if (target != nums[i]):

                continue

            if (first == -1): # FOUND

                first = i

            last = i

            print(first,last)

        return [first,last]