1. 两数之和

算法链接

https://leetcode-cn.com/problems/two-sum/

解法

package main
func twoSum(nums []int, target int) []int {
    hashTable := map[int]int{}
    for i, x := range nums {
        if p, ok := hashTable[target-x]; ok {
            return []int{p, i}
        }
        hashTable[x] = i
    }
    return nil
}
func main() {
}