interview-arithmetic/leetcode/tags/array/searchInsertPosition/main.go

package main

import "fmt"

func main() {
	var nums []int
	var target int

	nums = []int{1, 3, 5, 6}
	target = 5
	fmt.Println(searchInsert(nums, target))

	nums = []int{1, 3, 5, 6}
	target = 2
	fmt.Println(searchInsert(nums, target))

	nums = []int{1, 3, 5, 6}
	target = 7
	fmt.Println(searchInsert(nums, target))

	nums = []int{1, 3, 5, 6}
	target = 0
	fmt.Println(searchInsert(nums, target))
}

func searchInsert(nums []int, target int) int {
	for i := 0; i < len(nums); i++ {
		if nums[i] == target {
			return i
		}
		if nums[i] > target {
			return i
		}
	}
	return len(nums)
}