原题
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例 1:
输入: [1,3,5,6], 5
输出: 2
示例 2:
输入: [1,3,5,6], 2
输出: 1
示例 3:
输入: [1,3,5,6], 7
输出: 4
示例 4:
输入: [1,3,5,6], 0
输出: 0
解法
思想
二分查找
代码
Java
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length;
int mid;
while(left<right-1){
mid = (left+right)/2;
if(nums[mid] == target) return mid;
else if(nums[mid] < target) left = mid;
else if(nums[mid] > target) right = mid;
}
if(nums[left]>=target) return left;
return left+1;
}
}
Go(2020/07/05)
func searchInsert(nums []int, target int) int {
left := 0
right := len(nums)-1
for left < right{
mid := (left+right)/2
if nums[mid] == target { return mid }
if nums[mid] < target{
left = mid+1
}else{
right = mid
}
}
if nums[left] < target { return left+1 }
return left
}
Python(2020/07/05)
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left = 0
right = len(nums)-1
while left < right:
mid = (left+right)/2
if nums[mid] == target : return mid
if nums[mid] < target:
left = mid+1
else:
right = mid
if nums[left] < target : return left+1
return left
原创文章,作者:彭晨涛,如若转载,请注明出处:https://www.codetool.top/article/leetcode35-%e6%90%9c%e7%b4%a2%e6%8f%92%e5%85%a5%e4%bd%8d%e7%bd%ae/