LeetCode : Search Insert Position
来源:互联网 发布:康耐视视觉软件编程 编辑:程序博客网 时间:2024/04/30 12:04
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) { // Start typing your C/C++ solution below // DO NOT write int main() function int l = 0; int r = n - 1; int m; while(l <=r){ m = (l+r)/2; if(A[m] == target){ return m; } if(A[m] > target){ r = m-1; } else{ l = m+1; } } if(A[m] > target){ return m; } else{ return m+1; } }};
- 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
- LeetCode Search Insert Position
- 7k+的Java+android学习就靠他们了,绝对给力,学完保证7k+
- MyEclipse连接MySQL的方法
- MD5 (Message Digest Algorithm 5 信息—摘要算法5 ) 的一些体会 .
- 正则知识点
- SQL中JOIN ON WHERE的执行过程
- LeetCode : Search Insert Position
- input中id和name属性的区别
- unresolved external symbol _WinMain@16的解决方法
- 正则知识点
- 考记忆力小代码
- jdbc
- 使用FusionChart生成漂亮的报表
- 五个免费UML建模工具推荐
- android混淆打包配置(忽略第三方jar)