[Leetcode 1. 两数之和]

题目描述

题目实例

题解

• python

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        dic = {}
        for i, n in enumerate(nums):
            if target - n in dic:
                return [i, dic[target - n]]
            else:
                dic[n] = i

• golang

func twoSum(nums []int, target int) []int {
   val_map := make(map[int]int)
   for i, v := range nums {
      p, ok := val_map[target-v]
      if ok {
         return []int{p, i}
      }
      val_map[v] = i
   }
   return nil
}