Search Insert Position
来源:互联网 发布:青山水利造价软件 编辑:程序博客网 时间:2024/06/09 16:15
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.size()==0)
return 0;
int low=0;
int high=nums.size()-1;
while(low<=high)
{
int mid=(low+high)/2;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
low=mid+1;
else
high=mid-1;
}
return low;
}
};
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.size()==0)
return 0;
int low=0;
int high=nums.size()-1;
while(low<=high)
{
int mid=(low+high)/2;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
low=mid+1;
else
high=mid-1;
}
return low;
}
};
0 0
- LeetCode: Search Insert Position
- Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode34:Search Insert Position
- Search Insert Position
- [35]Search Insert Position
- Search Insert Position
- Search Insert Position
- [LeetCode]Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- Search Insert Position
- Search Insert Position
- 解决eclipse neno在线下载安装缓慢及失败的问题
- 架构学习之路——高可用高并发系统设计原则
- 学习Weblogic的学习之一
- python——高阶函数——闭包 装饰
- intellij idea maven 使用
- Search Insert Position
- java将16进制与10进制互相转换
- KMP算法
- mysql:command not found问题解决
- Python 将json格式文件转存为RDF格式文件
- POJ 3468 A Simple Problem with Integers(线段树)
- maven错误处理
- springboot-mybatis—多数据源
- google浏览器提示https不是安全链接