给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
请必须使用时间复杂度为 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
java利用二分法:
class Solution {
public int searchInsert(int[] nums, int target) {
if (target > nums[nums.length - 1]) {
return nums.length;
}
int left = 0, right = nums.length - 1;
while (left < right) {
int mid = left + (right - left) / 2;
int n = nums[mid];
if (n == target) {
return mid;
}
if (target > n) {
left = mid + 1;
} else {
right = mid;
}
}
return right;
}
}
python解法:
import bisect
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
return bisect.bisect_left(nums, target)
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/search-insert-position