算法（两数之和）

func twoSum(nums []int, target int) []int {
    array1 := make([]int, 0)
    final := 0
    for i := 0; i < len(nums); i++ {
        for j := 0; j < len(nums); j ++ {
            if (nums[i] + nums[j] == target && i != j) {
                array1 = append(array1, i)
                array1 = append(array1, j)
                final = 1;
            }
        }
        if (final == 1) {
            break;
        }
    }
    return array1
}

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