LeetCode: 35. Search Insert Position

友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

35. Search Insert Position

Given a sorted array 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 may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
public static int searchInsert(int[] nums, int target) {
    if (null == nums || nums.length == 0) {
        return 0;
    }

    if (target <= nums[0]) {
        return 0;
    }

    if (target > nums[nums.length - 1]) {
        return nums.length;
    }

    int result = -1;
    int low = 0;
    int high = nums.length - 1;
    while (low <= high) {
        int mid = low + (high - low) / 2;
        int midNum = nums[mid];
        if (midNum >= target
            && ((mid - 1) >= 0) && nums[mid - 1] < target) {
            result = mid;
            break;
        }
        if ((mid - 1 >= 0) && target <= nums[mid - 1]) {
            high = mid - 1;
        }
        if (midNum < target) {
            low = mid + 1;
        }
    }

    return result;
}