Find First And Last Position of Element In Sorted Array
You are 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.
Example 1:
Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]Example 2:
Input: nums = [1], target = 1
Output: [0,0]Constraints:
0 <= nums.length <= 100,000-1,000,000,000 <= nums[i], target <= 1,000,000,000numsis a non-decreasing array.