35. 搜索插入位置
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
请必须使用时间复杂度为 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
示例 4:
输入: nums = [1,3,5,6], target = 0
输出: 0
示例 5:
输入: nums = [1], target = 0
输出: 0
提示:
1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums
为无重复元素的升序排列数组-104 <= target <= 104
题解:
本提可采用二分法求解,设置左右指针初始值分别为0,nums.length -1,
取左右指针的中间值与目标值进行比较,循环判断,直到左指针大于右指针,如果中间值大于目标值,表明中间值右侧的值都会大于目标值,所以右指针左移至mid-1处,同理,若中间值小于目标值,则将左指针右移到mid+1处,若中间值等于目标值,则返回中间值,若知道循环退出仍没有找到匹配的值,则返回左指针或右指针。
Python:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
left,right = 0,len(nums)-1
while left <= right:
mid = left + (right-left)//2
if nums[mid] < target:
left = mid + 1
elif nums[mid] > target:
right = mid - 1
else:
return mid
return left
C++:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while(left <= right)
{
int mid = left + (right-left)/2;
if (nums[mid] < target)
{
left = mid + 1;
}else if(nums[mid] > target)
{
right = mid - 1;
}else{
return mid;
}
}
return left;
}
};
Java:
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while(left <= right)
{
int mid = left + (right-left)/2;
if (nums[mid] < target)
{
left = mid + 1;
}else if(nums[mid] > target)
{
right = mid - 1;
}else{
return mid;
}
}
return left;
}
}
运行结果: