leetcode35. Search Insert Position

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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

解法一

二分查找法，查找左边第一个大于等于target的位置。如果数组的长度<=2, 则不经过while循环，如果最后start和end位置的值都比target小，则返回数组的长度。

public class Solution {
    public int searchInsert(int[] nums, int target) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        int start = 0;
        int end = nums.length - 1;
        int mid;
        // 最后一个数比target都小，直接返回数组的长度，过滤一部分数组计算
        if (nums[end] < target) {
            return end + 1;
        }
        while (start + 1 < end) {
            mid = start + (end - start) / 2;
            if (nums[mid] == target) {
                end = mid;
//              return mid;
            }
            if (nums[mid] < target) {
                start = mid;
            }
            if (nums[mid] > target) {
                end = mid;
            }
        }
        if (nums[start] >= target) {
            return start;
        } else if (nums[end] >= target) {
            return end;
        }
        return 0;
    }
}

解法二

查找最后一个小于等于target的位置，如果等于，则返回该位置，小于，则返回该位置＋1。

public class Solution {
    public int searchInsert(int[] nums, int target) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        int start = 0;
        int end = nums.length - 1;
        int mid;
        // 如果第一个数大于target，则直接返回位置0
        if (nums[0] > target) {
            return 0;
        }
        while (start + 1 < end) {
            mid = start + (end - start) / 2;
            if (nums[mid] == target) {
                start = mid;
                // return mid;
            }
            if (nums[mid] < target) {
                start = mid;
            }
            if (nums[mid] > target) {
                end = mid;
            }
        }
        if (nums[end] < target) {
            return end + 1;
        } else if (nums[end] == target) {
            return end;
        } else if (nums[start] == target) {
            return start;
        } else {
            return start + 1;
        }
    }
}