# 35. Search Insert Position
-binary search

By [Vincentkovsky](https://paragraph.com/@wenzheng) · 2022-01-01

---

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

来源：力扣（LeetCode） 链接：[https://leetcode-cn.com/problems/search-insert-position](https://leetcode-cn.com/problems/search-insert-position) 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

    class Solution {
        public int searchInsert(int[] nums, int target) {
            int left=0;
            int right=nums.length-1;
            while(left<=right){
                int mid=left+((right-left)/2);
                if(nums[0]>target){
                    return 0;
                }
                if(nums[nums.length-1]<target){
                    return nums.length;
                }
                if(nums[mid]>target && nums[mid-1]<target){
                    return mid;
                }
                if(nums[mid]==target){
                    return mid;
                }else if(nums[mid]<target){
                    left=mid+1;
                }else{
                    right=mid-1;
                }
            }
            return -1;
        }
    }

---

*Originally published on [Vincentkovsky](https://paragraph.com/@wenzheng/35-search-insert-position-binary-search)*