一、问题描述
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
二、解题
1、Go
1.1 、暴力法
// leetcode-1
package main
import (
"fmt"
)
func twoSum(nums []int, target int) []int {
for i := 0; i < len(nums); i++ {
for j := i + 1; j < len(nums); j++ {
if nums[i]+nums[j] == target {
return []int{i, j}
}
}
}
return []int{}
}
func main() {
nums := []int{1, 3, 5, 2, 7, 11, 15}
for index, value := range nums {
fmt.Printf("index = %d, value = %d\n", index, value)
fmt.Println("index = %d, value = %d", index, value) //不支持格式化参数
}
result := twoSum(nums, 9)
fmt.Println(result)
}
输出结果
index = 0, value = 1
index = %d, value = %d 0 1
index = 1, value = 3
index = %d, value = %d 1 3
。。。
[3 4]
1.2、两遍哈希表
// leetcode-1
package main
import (
"fmt"
)
func twoSum(nums []int, target int) []int {
mapNum := make(map[int]int)
size := len(nums)
for i := 0; i < size; i++ {
mapNum[nums[i]] = i
}
for i := 0; i < size; i++ {
complement := target - nums[i]
if v, ok := mapNum[complement]; ok {
if v != i {
return []int{v, i}
}
}
}
return []int{}
}
func main() {
nums := []int{1, 3, 5, 2, 7, 11, 15}
result := twoSum(nums, 9)
fmt.Println(result)
}
输出
[4 3]
1.3、一遍哈希表
// leetcode-1
package main
import (
"fmt"
)
func twoSum(nums []int, target int) []int {
mapNum := make(map[int]int)
size := len(nums)
for i := 0; i < size; i++ {
complement := target - nums[i]
if v, ok := mapNum[complement]; ok {
//此处不用判断v != i,因为此时mamNum中还没有添加i值
return []int{v, i}
}
mapNum[nums[i]] = i
}
return []int{}
}
func main() {
nums := []int{1, 3, 5, 2, 7, 11, 15}
result := twoSum(nums, 9)
fmt.Println(result)
}
输出
[3 4]
2、python
2.1 暴力法
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
for i in range(len(nums)):
for j in range(i+1, len(nums)):
if nums[i] + nums[j] == target:
return [i, j]
2.2 使用if…in…
def twoSum(nums, target):
lens = len(nums)
j=-1
for i in range(lens):
if (target - nums[i]) in nums:
if (nums.count(target - nums[i]) == 1)&(target - nums[i] == nums[i]):#如果num2=num1,且nums中只出现了一次,说明找到是num1本身。
continue
else:
j = nums.index(target - nums[i],i+1) #index(x,i+1)是从num1后的序列后找num2
break
if j>0:
return [i,j]
else:
return []