【LeetCode】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

【分析】

思路主要是二分法

注意while循环的条件！！(left<=right)

注意最后return谁。。。left

. Only two cases:

 1 if found, just return current index

 2 if not found, return next index where the search end

【代码】

非递归：

    public int searchInsert(int[] A, int target) {
        int lo = 0;
        int hi = A.length - 1;
        while (lo <= hi) {
            int mid = lo + <span style="color:#ff6666;">(hi - lo) / 2;  //防止溢出</span>
            if (target < A[mid]) hi = mid - 1;
            else if (target > A[mid]) lo = mid + 1;
            else return mid;
        }
        return lo;
    }

递归：

注意：条件start>end，直接返回start即可。。。

int search(int A[], int start, int end, int target) {
    if (start > end) return start;
    int mid = (start + end) / 2;
    if (A[mid] == target) return mid;
    else if (A[mid] > target) return search(A, start, mid - 1, target);
    else return search(A, mid + 1, end, target);
}
int searchInsert(int A[], int n, int target) {
    return search(A, 0, n - 1, target);
}