[leetcode刷题系列]Search Insert Position
2013-08-04 20:35
363 查看
依旧是二分基础题， 没啥好说的- -
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 low = 0, high = n - 1, mid;
while(low <= high)
if(A[mid = low + high >> 1] >= target) high = mid - 1;else low = mid + 1;
return low;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 035. Search Insert Position
- LeetCode:Search Insert Position
- leetcode---search-insert-position---查找
- 【LeetCode】35. Search Insert Position
- 【leetcode】【35】Search Insert Position
- Search Insert Position leetcode java
- LeetCode — Search Insert Position
- [LeetCode]Search Insert Position
- Leetcode_num12_Search Insert Position
- LeetCode之Search Insert Position
- [leetCode] Search Insert Position
- LeetCode（35） Search Insert Position
- leetcode——Search Insert Position
- leetcode做题总结，题目Search Insert Position 2012/03/03
- LeetCode - Search Insert Position - Frequent
- [LeetCode] 35. Search Insert Position
- LeetCode 35 — Search Insert Position（C++ Java Python）
- 算法系列——Search Insert Position
- Leetcode-34-Search Insert Position-(Medium)
- LeetCode Search Insert Position