题目翻译*

Search Insert Position

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

 

Constraints:

• 1 <= nums.length <= 104
• -104 <= nums[i] <= 104
• nums contains distinct values sorted in ascending order.
• -104 <= target <= 104

搜索插入位置

给定一个排列好的各不相同的整数数组和一个目标值，如果数组内有这个值，返回它的下标，如果没有这个值，返回它应该在的位置的下标。

你要写一个具有0（logn）时间复杂性的算法。

例子1：

输入：nums=【1,3,5,6】，target=5

输出：2

例子2：

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

输出: 1

例子3：

输入: nums = [1,3,5,6], target = 7

输出: 4

限制：

1 <= nums.length <= 10000

-10000 <= nums[i] <=10000

-10000 <= target <=10000

Nums中值不同且按升序排列