🌵35. Search Insert Position
https://leetcode.com/problems/search-insert-position/
js
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
if (!nums.length) {
return 0
}
var l = 0
var r = nums.length - 1
while (l <= r) {
let m = (l + r) / 2 >> 0
if (nums[m] === target) {
return m
}
if (nums[m] > target) {
r = m - 1
} else {
l = m + 1
}
}
return l
}py
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
if not nums:
return 0
l, r = 0, len(nums) - 1
while l <= r:
m = (l + r) // 2
if nums[m] == target:
return m
if nums[m] > target:
r = m - 1
else:
l = m + 1
return l