[1] 两数之和（golang)-leetcode

/*
 * @lc app=leetcode.cn id=1 lang=golang
 *
 * [1] 两数之和
 */

// @lc code=start
//时间复杂度O(n^2)
func twoSum(nums []int, target int) []int {
    for i := 0; i < len(nums)-1; i++ {
        for j := i + 1; j < len(nums); j++ {
            if nums[i]+nums[j] == target {
                return []int{i, j}
            }
        }
    }
    return []int{0, 0}
}

//时间复杂度O(n)，利用map[目标值]原值位置
func twoSum(nums []int, target int) []int {
    temp := make(map[int]int)
    for i := 0; i < len(nums); i++ {
        val, ok := temp[nums[i]]
        if ok {
            return []int{val, i}
        } else {
            res := target - nums[i]
            temp[res] = i
        }
    }
    return []int{0, 0}
}
// @lc code=end

题目描述