Leetcode -- 35. Search Insert Position
来源:互联网 发布:mysql gt lt 大于小于 编辑:程序博客网 时间:2024/06/03 23:40
题目:
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
思路:二分查找,找到返回mid, 找不到直接返回left即可。
C++代码如下:
int searchInsert(vector<int>& nums, int target) { int l = 0, r = nums.size() - 1; int mid; while(l <= r) { mid = l + (r - l) / 2; if(nums[mid] == target) return mid; else if(nums[mid] < target) l = mid + 1; else r = mid - 1; } return l;}
0 0
- [LeetCode]35.Search Insert Position
- LeetCode --- 35. Search Insert Position
- LeetCode 35.Search Insert Position
- [Leetcode] 35. Search Insert Position
- LeetCode 35. Search Insert Position
- [leetcode] 35.Search Insert Position
- Leetcode 35. Search Insert Position
- 35. Search Insert Position LeetCode
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 【LeetCode】35. Search Insert Position
- leetcode 35. Search Insert Position
- leetcode 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode *** 35. Search Insert Position
- leetcode 35. Search Insert Position
- [LeetCode]35. Search Insert Position
- LeetCode 35. Search Insert Position
- 迭代器模拟实现STL中的list
- 使用jedis连接单机和集群redis的两种方式
- python中的is、==和cmp()比较字符串
- (16)caffe总结之自定义数据输入层
- Git详解(1)——Git起步
- Leetcode -- 35. Search Insert Position
- css3 images
- Android 得到函数耗时多少的方法
- js打开新窗口并且POST传入参数
- case用法(枚举条件选择)
- sass变量详解——你所不知道的sass
- 基于Spring、springmvc、mybatis框架开发的小后台系统附有源码
- Mysql实验(二)
- SVN 2.向服务器提交数据