Search Insert Position

Easy

/problems/search-insert-position

2000 ms128 MB2 visible tests

Problem statement

Given a strictly increasing integer list, return the index of a target if present. Otherwise return the index where it belongs to keep the list sorted.

Your function

Implement this function and return the result. CodeSprint supplies each test case automatically.

searchInsert(nums, target) → number

nums: number[]target: number

Examples

Example 1

Input

nums = [1, 3, 5, 6], target = 5

Output

Example 2

Input

nums = [1, 3, 5, 6], target = 2

Output

Constraints

0 <= nums.length <= 100,000
nums is sorted in strictly increasing order.