leetcode Search Insert Position

代码：

#include<iostream>

using namespace std;

int searchInsert(int A[], int n, int target) {
    int l = 0;
    int r = n - 1;
    while (l <= r){
        int mid = (l + r) / 2;
        if (target < A[mid]){
            r = mid - 1;
        }
        else if (target > A[mid]){
            l = mid + 1;
        }
        else{
            return mid;
        }
    }

    return r + 1;
}

int main(){
    int A[] = {1};
    cout << searchInsert(A, 1, 2) << endl;
}