leetcode--two number of the sum (1)

This is a created article in which the information may have evolved or changed.

1. Given an array of integers and a target value, find the two numbers in the array and the target values.

You can assume that each input corresponds to only one answer, and that the same element cannot be reused.

Example:

Given nums = [2, 7, one, all], target = 9

Because Nums[0] + nums[1] = 2 + 7 = 9
So return [0, 1]

Go implementation:

package mainimport (    "fmt")func main() {    nums := []int{1, 3, 4, 6, 7, 10}    target := 17    newArr := twoSum(nums, target)    fmt.Println(newArr)}func twoSum(nums []int, target int) []int {    maps := make(map[int]int)    for index, value := range nums {        member := target - value        if _, ok := maps[member]; ok {            return []int{member, value}        } else {            maps[value] = index        }    }    return []int{}}

Time complexity O (n);