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

 數組有序，因此折半查找，查找成功返回序號，查找不成功時返回插入點。

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