给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
请必须使用时间复杂度为 O(log n) 的算法。
示例 1:
输入: nums = [1,3,5,6], target = 5
输出: 2
示例 2:
输入: nums = [1,3,5,6], target = 2
输出: 1
示例 3:
输入: nums = [1,3,5,6], target = 7
输出: 4
提示:
1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums 为 无重复元素 的 升序 排列数组
-104 <= target <= 104
1. 没有学过二分查找(折半查找),就一脸懵逼。还要求时间复杂度为logN =_=!
2.二分查找模板:
public static int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
// int median = left + ((right - left) >> 1);
int median = (left + right) >>> 1 ;
// int median = (left + right) / 2;
if (nums[median] == target) {
return median;
}
if (nums[median] > target) {
right = median - 1;
} else {
left = median + 1;
}
}
return -1;
}
3. 使用二分查找算法,时间复杂度O(logN)
public static int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int median = left + ((right - left) >> 1);
// int median = (left + right) / 2;
if (nums[median] == target) {
return median;
}
if (nums[median] > target) {
right = median - 1;
} else {
left = median + 1;
}
}
return left;
}