题目描述
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例:
输入: [1,3,5,6], 5
输出: 2
python代码
版本1:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
n = len(nums)
left = 0
right = n-1
if nums[left] == target: return left
if nums[left] > target: return 0
if nums[right] == target: return right
if nums[right] < target: return n
while left < right-1:
mid = (left + right)>>1
if target == nums[mid]:
return mid
elif target > nums[mid]:
left = mid
else:
right = mid
return left + 1
版本2:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
right = len(nums) - 1
left = 0
if nums[right] < target:
return len(nums)
while left <= right :
mid = int((left + right) / 2)
if nums[mid] > target:
right = mid - 1
elif nums[mid] < target:
left = mid + 1
else:
return mid
return left
版本3:
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
return len([i for i in nums if i < target])