题目:链接
解题思想:双指针解法可以解决,数组的头部,尾部各一个指针(i,j),通过两个位置相加得出与target的大小关系,因为此时数组不严格递增,如果小于则可以调整头指针往上添加(i++),使得sum变大,大于则可以调整尾部指针往下(j–),使得sum变小,此时逐渐接近tatget。
func twoSum(numbers []int, target int) []int {
//二分+双指针法
low,high:=0,len(numbers)-1
for low<high{
if numbers[low]+numbers[high]>target{
high--
}else if numbers[low]+numbers[high]<target{
low++
}else{
return []int{low+1,high+1}
}
}
return []int{-1,-1}
}
二分查找法
func twoSum(numbers []int, target int) []int {
for i:=0;i<len(numbers);i++{
low,high:=i,len(numbers)-1
for low<=high{
mid := low+(high-low+1)/2
if numbers[i]+numbers[mid]==target{
return []int{i+1,mid+1}
}else if numbers[i]+numbers[mid]<target{
low = mid+1
}else {
high=mid-1
}
}
}
return []int{-1,-1}
}
哈希法,使用map键值对进行记录,键代表数值,值代表下标,每次寻找时寻找target-numbers[i]是否存在于map中即可。
func twoSum(numbers []int, target int) []int {
var res=make(map[int]int)
for i:=0;i<len(numbers);i++{
if res[target-numbers[i]]!=0{
return []int{res[target-numbers[i]],i+1}
}
res[numbers[i]]=i+1
}
return []int{-1,-1}
}