Package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array

Class Solution

  • public class Solution
extends Object
    34 - Find First and Last Position of Element in Sorted Array\. Medium 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 = [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

    • Constructor Detail

      • Solution

        public Solution()

    • Method Detail

      • searchRange

        public int[] searchRange​(int[] nums,
                         int target)