Package g0001_0100.s0035_search_insert_position

Class Solution

java.lang.Object

g0001_0100.s0035_search_insert_position.Solution

public class Solution
extends Object

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:** * 1 <= nums.length <= 104 * -104 <= nums[i] <= 104 * `nums` contains **distinct** values sorted in **ascending** order. * -104 <= target <= 104

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	searchInsert(int[] nums, int target)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

searchInsert

public int searchInsert(int[] nums,
 int target)