class Solution {
public:
int searchInsert(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int left = 0;
int right = n - 1;
int mid = 0;
while (left <= right)
{
mid = (left + right) >> 1;
if (A[mid] > target)
{
right = mid - 1;
}
else if (A[mid] < target)
{
left = mid + 1;
}
else
{
break;
}
}
return A[mid] >= target ? mid : mid + 1;
}
};
LeetCode-Search Insert Position
最新推荐文章于 2024-09-25 13:54:13 发布