• ㊗️
• 大家
• offer
• 多多！

## Problem

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 <= 10^4$
• $-10^4 <= nums[i] <= 10^4$
• nums contains distinct values sorted in ascending order.
• $-10^4 <= target <= 10^4$

## Code

class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;

while(left + 1 < right){
int mid = (left + right) / 2;
if(nums[mid] == target) return mid;

if(nums[mid] > target){
right = mid;
} else if (nums[mid] < target){
left = mid;
}
}

if(target <= nums[left]){
return left;
} else if(target <= nums[right]){
return right;
} else if(target > nums[right]) {
return right + 1;
} else {
return -1;
}
}
}