Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    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:

    • <code>0 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>

    • nums is a non-decreasing array.

    • <code>-10<sup>9</sup><= target <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final IntArray searchRange(IntArray nums, Integer target)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait