[leetcode-in-go] 0001-Two Sum

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 追踪记录数字所在位置（下标）

func twoSum(nums []int, target int) []int {
	// key 为数字，value 为其下标
	tab := make(map[int]int, len(nums))

	for i, v := range nums {
		// 找到目标，直接返回结果
		if j, ok := tab[target-v]; ok {
			return []int{j, i}
		}
		// 未找到，存储当前数字的下标
		tab[v] = i
	}
	return []int{-1, -1}
}