Search Insert Position
来源:互联网 发布:淘宝怎样联系天猫客服 编辑:程序博客网 时间:2024/06/08 17:41
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) { int low = 0; int high = n - 1; while(low <= high) { int mid = (low + high) / 2; if(A[mid] < target) low = mid + 1; else if(A[mid] > target) high = mid - 1; else return mid; } return low; }};
0 0
- LeetCode: Search Insert Position
- Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode34:Search Insert Position
- Search Insert Position
- [35]Search Insert Position
- Search Insert Position
- Search Insert Position
- [LeetCode]Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- Search Insert Position
- Search Insert Position
- SDN阅读材料
- 算法学习笔记_方程求根
- Apache Ant+Junit对Java(Spring MVC(基于注解))工程进行测试(二)
- ibatis mybatis sql语句配置 符号不兼容 大于号 小于号
- java操作本地磁盘目录下的问题相关资料
- Search Insert Position
- 在论坛中出现的比较难的sql问题:18(字符合并 整数解析星期几)
- 关于 System.getProperty("line.separator")
- USB的通讯协议(通俗易懂)
- 死锁问题
- 常用边缘检测算子及其特性
- 第三方dll文件使用
- Android Volley完全解析(三),定制自己的Request
- invisible index