class Solution {
public:
int searchInsert(int A[], int n, int target) {
int ans = n;
int begin = 0, end = n-1;
while(begin <= end)
{
int mid = begin + (end-begin)/2;
if(A[mid] >= target)
{
end = mid-1;
ans = mid;
}
else
begin = mid+1;
}
return ans;
}
};
leetcode:Search Insert Position
最新推荐文章于 2021-05-03 16:49:38 发布