[LeetCode] Search Insert Position [21]
来源:互联网 发布:前瞻数据网 编辑:程序博客网 时间:2024/05/22 06:36
题目
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.[1,3,5,6]
, 5 → 2[1,3,5,6]
, 2 → 1[1,3,5,6]
, 7 → 4[1,3,5,6]
, 0 → 0
原题链接(点我)
解题思路
给一个排序数组和一个数,寻找该数在数组的位置或者插入位置。本题考查对二分查找的理解和二分查找树。二分查找查找失败的位置就是该数在数组中该插入的位置。
代码实现
class Solution {public: int searchInsert(int A[], int n, int target) { if(A==NULL || n<=0) return -1; int begin=0, end=n-1; while(begin<=end){ int mid = (begin+end)/2; if(A[mid] == target) return mid; if(A[mid] > target) end = mid-1; else begin = mid+1; } return begin; }};
如果你觉得本篇对你有收获,请帮顶。
另外,我开通了微信公众号--分享技术之美,我会不定期的分享一些我学习的东西.
另外,我开通了微信公众号--分享技术之美,我会不定期的分享一些我学习的东西.
你可以搜索公众号:swalge 或者扫描下方二维码关注我
(转载文章请注明出处: http://blog.csdn.net/swagle/article/details/29371109 )
1 0
- [LeetCode] Search Insert Position [21]
- 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
- proxy.ini各项参数介绍
- C/C++产生指定范围和不定范围随机数的实例代码
- Hello World!
- Linux查看文件夹大小
- Arm 中断处理
- [LeetCode] Search Insert Position [21]
- C#中MessageBox用法大全(附效果图)
- NuptOJ1041线段相交——向量积
- malloc与new区别
- Android系统镜像文件的打包过程分析
- 通过位与方法获取三色值,十六进制色值转换RGB
- 数据结构学习笔记1-线性表(顺序表,单链表)
- 转 -- 如何高效利用GitHub
- 百度地图在viewDidLoad中BMKMapManager初始化crash