LeetCode *** 35. Search Insert Position
来源:互联网 发布:hat linux重置root密码 编辑:程序博客网 时间:2024/06/09 22:52
题目:
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 low=0,high=nums.size()-1; while(low<high){ int mid=(low+high)/2; if(target>nums[mid]){ low=mid+1; } else if(target<nums[mid]){ high=mid; }else return mid; } if(nums[low]>=target)return low; else return low+1; }};
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
- 解决CocoaPods pod install/pod update更新慢的问题
- android 捕获全局异常
- 深度理解IOC
- android最流行的网络框架
- C++基本语法-----struct
- LeetCode *** 35. Search Insert Position
- 基于AdaBoost的分类(测试算法)
- 数字格式化,从右往左每隔三位加逗号(利用递归)
- 每天laravel-20160710|Event
- linux二进制分发软件包的安装和卸载
- 栅格化设计
- 《Python数据分析基础教程:Numpy学习指南》- 速记 - 第十一章
- mongodb数据导出与导入
- 安卓studio的使用