35. 搜索插入位置 @Python @Go

原题

https://leetcode.cn/problems/search-insert-position/description/

思路

二分查找

复杂度

时间：O(log(n))
空间：O(1)

Python代码

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        l, r = 0, len(nums)
        while l < r:
            mid = (l + r) // 2 
            if target == nums[mid]:
                return mid 
            elif target > nums[mid]:
                l = mid + 1 
            elif target < nums[mid]:
                r = mid 
        return l 
        

Go代码

func searchInsert(nums []int, target int) int {
	l, r := 0, len(nums)
	for l < r {
		mid := (l + r) / 2
		if target == nums[mid] {
			return mid
		} else if target > nums[mid] {
			l = mid + 1
		} else if target < nums[mid] {
			r = mid
		}
	}
	return l
}