LeetCode 34. Search Insert Position
2014-06-21 07:44
417 查看
二分查找插入的位置。
若恰好匹配num[mid] == target, 返回mid;
若num[mid] < target && num[mid+1] > target, 返回mid+1.
注意边界检查。
代码：
若恰好匹配num[mid] == target, 返回mid;
若num[mid] < target && num[mid+1] > target, 返回mid+1.
注意边界检查。
代码：
class Solution
{
public:
int searchInsert(int A[], int n, int target)
{
int l=0, r=n-1, mid;
while (l <= r)
{
mid = (l+r) >> 1;
if (A[mid] == target)
{
return mid;
} else if (A[mid]<target && (mid+1==n || A[mid+1]>target)) // 边界检查
{
return mid+1;
} else if (A[mid] < target)
{
l = mid + 1;
} else
{
r = mid - 1;
}
}
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode-34-Search Insert Position-(Medium)
- LeetCode(34)SearchInsertPosition
- LeetCode34:Search Insert Position
- LeetCode 34 Search Insert Position
- [leetcode-34]Search Insert Position(c)
- leetcode 34 Search Insert Position
- LeetCode之Search Insert Position
- leetcode--Search Insert Position
- [leetcode] 35. Search Insert Position
- Leetcode: Search Insert Position
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- Search Insert Position leetcode java
- 【Leetcode】Lee.35. Search Insert Position
- 【一天一道LeetCode】#35. Search Insert Position
- leetcode: Search Insert Position
- SearchInsertPosition --leetcode
- LeetCode Search Insert Position
- leetcode--Search Insert Position
- 【leetcode】Search Insert Position