leetcode - Search Insert Position
来源:互联网 发布:手机格式化后数据恢复 编辑:程序博客网 时间:2024/06/13 01:20
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 l = 0; int h = n; while(l < h) { int mid = (l+h)/2; if(A[mid] > target) h = mid; else if(A[mid] < target) l = mid+1; else return mid; } return l; }};
0 0
- 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
- 普林斯顿公开课 算法1-9:并查集-快速合并
- next permutation函数
- ArcEngine10 轻松入门教程
- Paoding Analyzer
- CentOS配置163 YUM源
- leetcode - Search Insert Position
- 2442: [Usaco2011 Open]修剪草坪
- 开始学习web安全 & 搭建 Damn Vulnerable Web App 渗透测试平台
- 编写ant:build.xml的方法
- 快速排序代码实现
- 一个长整数串去除m位使其最大
- Spring-配置文件Bean定义中parent属性详解
- OCP 1Z0 051 158
- 二分查找法