用hash保存另一个数的值，遍历的同时判断是否存在
func twoSum(nums []int, target int) []int {
m := make(map[int]int)
for i := 0; i < len(nums); i++ {
c, ok := m[nums[i]]
if ok {
r := []int{c, i}
return r
} else {
m[target-nums[i]] = i
}
}
r := []int{0, 0}
return r
}
用hash保存另一个数的值，遍历的同时判断是否存在
Given an array of integers, return indices of the two num...
Description Given an array of integers, return indices of...
Problem Given an array of integers, return indices of the...
Given an array of integers, return indices of the two num...
Leetcode: 1. Two SumGiven an array of integers, return in...
Example:Given nums = [2, 7, 11, 15], target = 9,Because n...
描述 Given an array of integers, return indices of the two ...
Description Given an array of integers, return indices of...
本文标题：1. Two Sum.go
本文链接：https://www.haomeiwen.com/subject/meskvqtx.html
网友评论