Package g0001_0100.s0035_search_insert_position

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    35 - Search Insert Position.

    Easy

    Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

    You must write an algorithm with O(log n) runtime complexity.

    Example 1:

    Input: nums = 1,3,5,6, target = 5

    Output: 2

    Example 2:

    Input: nums = 1,3,5,6, target = 2

    Output: 1

    Example 3:

    Input: nums = 1,3,5,6, target = 7

    Output: 4

    Example 4:

    Input: nums = 1,3,5,6, target = 0

    Output: 0

    Example 5:

    Input: nums = 1, target = 0

    Output: 0

    Constraints:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

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

    • nums contains distinct values sorted in ascending order.

    • <code>-10<sup>4</sup><= target <= 10<sup>4</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 Integer searchInsert(IntArray nums, Integer target)

      • Methods inherited from class java.lang.Object

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