搜索插入位置

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) {
        int min = 0;
        int max = A.length - 1;
        
        if (A == null || A.length == 0) {
            return 0;
        }
        
        while (min <= max) {
            int mid = min +  (max - min) / 2;
            if (A[mid] == target) {
                return mid;
            }
            else if (A[mid] > target) {
                max = mid - 1;
            } else {
                min = mid + 1;
            }
            
        }
        return min;
    }
}