LeetCode 34. Search Insert Position
来源:互联网 发布:java接口的好处 编辑:程序博客网 时间:2024/06/11 05:35
二分查找插入的位置。
若恰好匹配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; } } }};
0 0
- LeetCode 34. Search Insert Position
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- [LeetCode]Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode-Search Insert Position
- LeetCode - Search Insert Position
- LeetCode | Search Insert Position
- Leetcode: Search Insert Position
- 【LeetCode】Search Insert Position
- Leetcode Search Insert Position
- Leetcode: Search Insert Position
- LeetCode:Search Insert Position
- leetcode Search Insert Position
- MFC内存泄漏跟踪
- 表压缩与索引失效
- BZOJ 刷题记录 PART 4
- c++ 赋值运算符
- ORACLE重建索引需要考虑问题
- LeetCode 34. Search Insert Position
- ubuntu下安装java
- 【转帖】Linux下安装GIT
- ubunt下的mysql安装
- ubuntu下的tomcat安装
- centos 安装五笔输入法
- XAML —— 命名空间
- 先尝鲜一下其中一个示例程序的运行截图
- oracle中通过decode实现行变列的二维表统计展示