0035.搜索插入位置

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

方法一：二分搜索

时间复杂度 $O(\log n)$，空间复杂度 $O(1)$。

func searchInsert(nums []int, target int) int {
	left, right := 0, len(nums)-1
	for left <= right {
		mid := left + (right-left)>>1
		if nums[mid] >= target {
			right = mid - 1
		} else {
			left = mid + 1
		}
	}
	return left
}