leetcode-35 Search Insert Position

<span style="font-family:Microsoft YaHei;font-size:14px;">int searchInsert(int A[], int n, int target) {
    int low = 0,high = n-1;
    while(low <= high){
        int mid = (low + high)/2;
        if(A[mid] == target) return mid;
        else if(A[mid] < target) low = mid + 1;
        else high = mid - 1;
    }
    if(low > high)
        return high + 1;//或者return low，这个判断需要有
}</span>

<span style="font-family:Microsoft YaHei;font-size:14px;">int helper(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 helper(A,start,mid - 1,target);
    else return helper(A,mid+1,end,target);
}
int searchInsert(int A[], int n, int target) {
    return helper(A,0,n-1,target);
}</span>