[leetcode] 35. Search Insert Position
来源:互联网 发布:杭州程序员招聘网站 编辑:程序博客网 时间:2024/06/07 02:21
题目链接:https://leetcode.com/problems/search-insert-position/
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(vector<int>& nums, int target) { int left = 0,right = nums.size()-1; while(left <= right){ int mid = (left + right)/2; if(nums[mid] < target) left = mid + 1; else right = mid - 1; } return left; }};
阅读全文
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
- 连接别人电脑的oracle数据库,配置TNS
- 设计模式C++实现(8)——代理模式
- 升级10.12后使用CocoaPod出现-bash: pod: command not found 解决办法
- 【LeetCode】167. Two Sum II
- 两个有序序列的中位数(二分搜索)
- [leetcode] 35. Search Insert Position
- Maximum Subarray-LeetCode JavaScript
- 选择结构
- 1191: 【蟠桃记】
- 独木舟上的旅行
- Max Consecutive Ones
- 在Win7下如何自动加载虚拟磁盘VHD文件
- linux 免登录以及配置别名登录
- 问题 C: 活了多少秒