LeetCode 1. Two Sum

标签：return   dice   UNC   code   hat   inpu   div   ret   not   

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]

func twoSum(nums []int, target int) []int {
    var solution []int
    noanswer := []int{0, 0}
    for i, v := range nums {
        tmp := target - v
        for j, v2 := range nums {
            if i != j && v2 == tmp {
                solution = append(solution, i, j)
                return solution
            }
        }
    }
    return noanswer
}

LeetCode 1. Two Sum

标签：return   dice   UNC   code   hat   inpu   div   ret   not   

原文地址：https://www.cnblogs.com/yachen2018/p/9241445.html