class Solution {
public:
int searchInsert(int A[], int n, int target) {
int begin, mid, end;
begin = 0; end = n-1;
while( begin < end )
{
mid = (end+begin) / 2;
if( target == A[mid] )
return mid;
else if( target > A[mid] )
{
begin = mid+1;
}
else if( target < A[mid] )
{
end = mid-1;
}
}
if( target <= A[begin] )
return begin;
else
return begin+1;
}
};
Search Insert Position
最新推荐文章于 2024-01-15 10:06:47 发布