package _001_two_sum

// 1. 两数之和
// https://leetcode-cn.com/problems/two-sum/

func twoSum(nums []int, target int) []int {
	m := make(map[int]int)
	for i, v := range nums {
		need := target - v
		if _, ok := m[need]; ok {
			return []int{m[need], i}
		} else {
			m[v] = i
		}
	}
	return nil
}