[LeetCode]--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

我第一时间想到还是二分查找法。就是处理mid和重复出现的数字的时候会有一点点卡，其余应该都没问题，所以直接上代码。

public int searchInsert(int[] nums, int target) {
        int low = 0, high = nums.length - 1, temp = -1, mid = -1;
        while (low <= high) {
            mid = (low + high) / 2;
            if (nums[mid] == target) {
                temp = mid;
                break;
            }
            if (nums[mid] > target)
                high = mid - 1;
            if (nums[mid] < target)
                low = mid + 1;
        }
        if (temp == -1) {
            if (nums[mid] < target)
                return mid + 1;
            else
                return mid;
        }
        while (temp > 0 && nums[temp - 1] == target)
            temp--;
        return temp;
    }