leetcode:35. Search Insert Position

35. Search Insert Position

Description

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2
Example 2:

Input: [1,3,5,6], 2
Output: 1
Example 3:

Input: [1,3,5,6], 7
Output: 4
Example 4:

Input: [1,3,5,6], 0
Output: 0

Answer

package main

import "fmt"

func searchInsert(nums []int, target int) int {

    var index int
    //找出i的位置
    for i := 0; i < len(nums); i++ {
        if nums[i] == target || nums[i] < target {
            index = i
        }
    }

    //判断最前，最后位置
    if nums[index] < target {
        return index + 1
    } else {
        return index
    }

}

func main() {
    arr := []int{1, 2}
    fmt.Println(searchInsert(arr, 0))
}