c++ 计蒜客挑战难题第10题寻找插入位置 二分查找

#include <iostream>

using namespace std;

int searchInsert(int a[],int n,int target)

{
int min = 0, max = n-1, mid;
while (min < max) {
mid = (max+min) >> 1;
if (target > a[mid])
min = mid+1;

        else if (target == a[mid])

            return mid;
else 
max = mid;

}

    if (target > a[n-1])

        return n;
return min;

}

int main()

{
int t, n, target = 0;

    cin >> n;
int *a = new int
;

    

    for (int i = 0; i < n ; i++)
cin >> a[i];
cin >> target;

    

    cout << searchInsert(a,n,target);
return 0;

}