思路
从两端向中间遍历
code
func twoSum(numbers []int, target int) []int {
l, r := 0, len(numbers)-1
for l < r {
if numbers[l]+numbers[r] < target {
l++
} else if numbers[l]+numbers[r] > target {
r--
} else {
return []int{l + 1, r + 1}
}
}
return nil
}
更多内容请移步我的repo:https://github.com/anakin/golang-leetcode