int searchInsert(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(n<=0) return 0;
int left=0;
int right=n-1;
int middle=0;
while(left<=right)
{
middle=left+(right-left)/2;
if(A[middle]==target)
{
return middle;
}
else if(A[middle]<target)
{
left=middle+1;
}
else
{
if(middle==0||A[middle-1]<target)
{
return middle;
}
else
{
right=middle-1;
}
}
}
return n;
}
Search Insert Position
最新推荐文章于 2024-01-15 10:06:47 发布