leetcode-Search Insert Position
来源:互联网 发布:编程判断质数 编辑:程序博客网 时间:2024/06/13 00:53
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
思路:二分法(寻找第一个比target大或相等的元素)
代码:
int searchInsert(int A[], int n, int target) {
int p=0;
int q=n-1;
int mid=0;
while(p<=q)
{
mid=(p+q)/2;
if(target <= A[mid])
{
if(mid>0 && target>A[mid-1])
{
return mid;
}
else if(mid == 0)
{
return mid;
}
else
{
q=mid-1;
}
}
else
{
if(mid+1<n && target<=A[mid+1])
{
return mid+1;
}
else if(mid+1 == n)
{
return mid+1;
}
else
{
p=mid+1;
}
}
}
}
0 0
- 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
- Leetcode: Search Insert Position
- LeetCode:Search Insert Position
- leetcode Search Insert Position
- LeetCode Search Insert Position
- javascript的prototype原理理解
- 在jstl中使用char类型的问题
- 分支-09. 分段计算居民水费(10)
- KMP字符串匹配
- ExtJS树的选择操作
- leetcode-Search Insert Position
- Oracle EBS 应付发票 接口导入 API
- 适配器模式
- DEDECMS修改标题长度限制
- Java类加载器ClassLoader详解
- 网络技术与技术革命周末随想
- C# 委托 事件
- 动手学Android之十二——补充点控件知识
- 从HTTP 2.0想到的关于传输层协议的一些事