首页 > 代码库 > leetcode : Search Insert Position
leetcode : 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
tag : binary search .
left < right - 1 目的是最终不会出现 left > right的情形。 因此，结束时可能最终指针停留在两个元素上。
public class Solution {
public int searchInsert(int[] nums, int target) {
if(nums == null ||nums.length == 0) {
return 0;
}
int left = 0;
int right = nums.length - 1;
while (left < right - 1) {
int mid = left + (right - left) / 2;
if(target == nums[mid]) {
return mid;
}
if(target > nums[mid]) {
left = mid;
} else {
right = mid;
}
}
if(nums[left] >= target) {
return left;
}
if(target > nums[right]) {
return right + 1;
}
return right;
}
}
leetcode : Search Insert Position
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。