LintCode-60.搜索插入位置

public class Solution {
    /** 
     * param A : an integer sorted array
     * param target :  an integer to be inserted
     * return : an integer
     */
    public int searchInsert(int[] A, int target) {
        // write your code here
        int low = 0, high = A.length - 1, mid = 0;
        if(A.length == 0) return 0;
        while(low <= high){
            mid = (low + high) / 2;
            if(A[mid] == target) return mid;
            else if(A[mid] > target) high = mid-1;
            else low = mid+1;
        }
        if(A[mid] > target) return mid;
        else return mid + 1;
    }
}