leetCode: BInary 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

#include<iostream>
using namespace std;

class Solution{
public:
    int searchInsert(int A[],int n,int target){
        if(A[0]> target || A[n-1] < target) {
            cout<<"Surely, this number isn't in the array"<<endl;
            return -1;
        }
        if(A[0]==target){
        	cout<<"the fisrt number equals the target"<<endl;
        	return 0;
        }

        if(A[n-1]==target){
        	cout<<"the last number equals the target"<<endl;
        	return n;
        }

        int low, high,middle;// the middle
        low=0;high=n-1;middle=(low+high)/2;
        while(low < high){
            if(A[middle] < target){
                low=middle;
                middle=(low+high)/2;
            }else{
                high=middle;
                middle=(low+high)/2;
            }
            if(A[middle]==target){
                cout<<"the number is in the array"<<endl;
                cout<<"and the position is :"<<middle+1<<"-th"<<endl;
                return middle;
            }
            if(low==middle){
                cout<<"the number is not in the array"<<endl;
                cout<<"it should be the :"<<low+2<<"-th element"<<endl;
                
                return low+1;
            }
            
        }//while
    }

};

int main(){
    int array[]={1,3,5,7,9,11,17};
    Solution sol;
    sol.searchInsert(array,7,4);
    
}

更好的一个方法是

int search(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 search(A, start, mid - 1, target);
    else return search(A, mid + 1, end, target);
}
int searchInsert(int A[], int n, int target) {
    return search(A, 0, n - 1, target);
}