题解 | #两数之和#

package main

/**
  * 
  * @param numbers int整型一维数组 
  * @param target int整型 
  * @return int整型一维数组
*/
func twoSum( numbers []int ,  target int ) []int {
	res := make([]int, 0)
	numMap := make(map[int]int, 0)
	for i := 0; i < len(numbers); i++ {
		numMap[numbers[i]] = i
	}
	for i := 0; i < len(numbers); i++ {
		remain := target - numbers[i]
		if val, ok := numMap[remain]; ok && val != i {
			res = append(res, i + 1, val + 1)
			return res
		}
	}
	return res
}