LeetCode - 1. Two Sum
Example 1
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2
Input: nums = [3,2,4], target = 6
Output: [1,2]
Solution
func twoSum(nums []int, target int) []int {
temp := make(map[int]int)
for k, v := range nums {
if index, ok := temp[target - v]; ok {
return []int{index, k}
} else {
temp[v] = k
}
}
return nil
}
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Input: nums = [3,2,4], target = 6
Output: [1,2]
Solution
func twoSum(nums []int, target int) []int {
temp := make(map[int]int)
for k, v := range nums {
if index, ok := temp[target - v]; ok {
return []int{index, k}
} else {
temp[v] = k
}
}
return nil
}
func twoSum(nums []int, target int) []int {
temp := make(map[int]int)
for k, v := range nums {
if index, ok := temp[target - v]; ok {
return []int{index, k}
} else {
temp[v] = k
}
}
return nil
}
Author And Source
この問題について(LeetCode - 1. Two Sum), 我々は、より多くの情報をここで見つけました https://qiita.com/moonlightbox/items/b946795dd0bb3aa0fb8a著者帰属：元の著者の情報は、元のURLに含まれています。著作権は原作者に属する。
Content is automatically searched and collected through network algorithms . If there is a violation . Please contact us . We will adjust (correct author information ,or delete content ) as soon as possible .