LeetCode[Array]: Search Insert Position
来源:互联网 发布:h3c magic b1端口速率 编辑:程序博客网 时间:2024/05/16 08:30
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
很典型的二分查找,只需要注意一个问题即可:如果未找到,那么high必然在low的前一个,此时low才是应该返回的位置。这个仔细想一下不难想到。
我的C++代码实现如下:
int searchInsert(int A[], int n, int target) { int low = 0, high = n - 1; while (low <= high) { int middle = (low + high) >> 1; if (A[middle] == target) return middle; else if (A[middle] > target) high = middle - 1; else low = middle + 1; } return low;}
0 0
- LeetCode[Array]: Search Insert Position
- LeetCode - Array/Binary Search - Search Insert Position
- LeetCode刷题【Array】Search Insert Position
- leetcode.array--35. 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
- iOS数据结构-知识点总结-队列
- 第十五周项目2-程序阅读(对指针的理解2)
- Android入门笔记 - 界面开发 - ProgressDialog
- Android网络编程总结(一)
- contentobserver笔记
- LeetCode[Array]: Search Insert Position
- poj 1338 Ugly Numbers
- c 语言中无符号整型(unsigned)的溢出
- MySQL 获得当前日期时间(以及时间的转换)
- 压力测试I工具jmeter插件
- 浅谈快速排序
- ASP.NET 5概观(ASP.NET 5 Overview)
- centos 7 firewalld基本配置
- 第14周 oj平台<对10个国家进行排序>