LeetCode—search-insert-position（找到指定的值，否则是可能的位置）—java

题目描述：

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不在list中存在时返回-1，而本题则需要返回该target应在此list中插入的位置。 
  
• 当循环结束时，如果没有找到target，那么low一定停target应该插入的位置上，high一定停在恰好比target小的index上。
  

代码：https://www.cnblogs.com/springfor/p/3857652.html?utm_source=tuicool

public class Solution {
    public int searchInsert(int[] A, int target) {
        if(A==null||A.length==0)
            return 0;
        int low = 0;
        int high = A.length-1;
        while(low<=high){
            int mid = (low+high)/2;
            if(target>A[mid])
                low = mid +1;
            else if(target<A[mid])
                high = mid-1;
            else
                return mid;
        }
        return low;
    }
}