leetcode-0001

func twoSum(nums []int, target int) []int {
	m := make(map[int]int, len(nums))
	for i, b := range nums {
		if j, ok := m[target-b]; ok {
			return []int{j, i}
		}
		m[nums[i]] = i
	}
	return nil
}

class Solution:
    def twoSum(self, nums, target):
        if len(nums) <= 1:
            return False
        d = dict()
        for i, val in enumerate(nums):
            if nums[i] in d:
                return [d[val], i]
            d[target - val] = i