Go语言实现Two Sum

描述

Write a function that takes an array of numbers (integers for the tests) and a target number. It should find two different items in the array that, when added together, give the target value. The indices of these items should then be returned in a tuple like so: (index1, index2).
For the purposes of this kata, some tests may have multiple answers; any valid solutions will be accepted.
The input will always be valid (numbers will be an array of length 2 or greater, and all of the items will be numbers; target will always be the sum of two different items from that array).

分析

方法1：外层遍历第一个数，内层遍历第二个数，如果两个数的和满足要求，则返回两个数的索引。
方法2：只遍历一遍，用空间换时间。

实现

方法1：

func TwoSum(numbers []int, target int) [2]int {

    for i:=0; i<len(numbers)-1; i++ {
      for j:=i+1; j<len(numbers); j++ {
        if numbers[i] + numbers[j] == target {
          return [2]int{i,j}
        }
      }
    }
    return [2]int{}
}

方法2：

import "fmt"

func TwoSum(numbers []int, target int) [2]int {
  h := map[int]int{}
  for i, v := range numbers {
    if _, ok := h[v]; ok { return [2]int{h[v], i} }
    h[target -v] = i
  }
  return [2]int{}
}