Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
/**
思路:遍历的同时把每个数组的值得索引存入map,
然后计算和目标值得差值,用此差值到map中找对应的索引
*/
func twoSum(nums []int, target int) []int {
nummap := make(map[int]int,len(nums))
for k,v := range nums {
var num = target - v
if result,ok := nummap[num]; ok {
return []int{result,k}
}
nummap[v] = k
}
return nil
}