1. 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].

 

---

Solution  (array和map之间的沟通，map可以通过判断不存在创建，之后再进行判断)

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

1.if 和ok 复合判断

2.map[v]左值为对应的value,右值为判断是否存在，两者的连接