package q35

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

var _ = searchInsert