LeetCode之Search Insert Position
【摘要】 1、问题
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 dup...
1、问题
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
2、分析
我们这里用二分法，然后要注意的是，获取中间的下标是开始下标加末尾小标除以2，而不是末尾下标减去开始下标除以2，这里以后要注意。
3、代码实现
-
public static int searchInsert(int[] nums, int target) {
-
int index = 0;
-
if (nums == null || nums.length == 0) {
-
return index;
-
}
-
if (target <= nums[0]) {
-
return 0;
-
}
-
int length = nums.length;
-
int start = 0;
-
int end = length;
-
while (start <= end) {
-
int mid = (end + start) / 2;
-
if (target < nums[mid]) {
-
end = mid;
-
} else if (target > nums[mid]){
-
start = mid;
-
} else {
-
return mid;
-
}
-
if (start - end == -1) {
-
return start + 1;
-
}
-
}
-
return index;
-
}
文章来源: chenyu.blog.csdn.net，作者：chen.yu，版权归原作者所有，如需转载，请联系作者。
原文链接：chenyu.blog.csdn.net/article/details/76796700
【版权声明】本文为华为云社区用户转载文章，如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）