leetcode刷题笔记(Golang)--16. 3Sum Closest
煮酒_zzh · · 1381 次点击 · · 开始浏览原题链接16. 3Sum Closest
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
解题思路:与3sum问题基本一致
func threeSumClosest(nums []int, target int) int {
var res int = nums[0] + nums[1] + nums[2]
sort.Ints(nums)
lg := len(nums)
for i := 0; i < lg-2; i++ {
l := i + 1
r := lg - 1
for l < r {
_sum := nums[i] + nums[l] + nums[r]
if _sum == target {
return target
} else if _sum > target {
r--
} else {
l++
}
if math.Abs(float64(_sum-target)) < math.Abs(float64(res-target)) {
res = _sum
}
}
}
return res
}
有疑问加站长微信联系(非本文作者)
入群交流(和以上内容无关):加入Go大咖交流群,或添加微信:liuxiaoyan-s 备注:入群;或加QQ群:692541889
关注微信- 请尽量让自己的回复能够对别人有帮助
- 支持 Markdown 格式, **粗体**、~~删除线~~、
`单行代码` - 支持 @ 本站用户;支持表情(输入 : 提示),见 Emoji cheat sheet
- 图片支持拖拽、截图粘贴等方式上传
收入到我管理的专栏 新建专栏
原题链接16. 3Sum Closest
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
解题思路:与3sum问题基本一致
func threeSumClosest(nums []int, target int) int {
var res int = nums[0] + nums[1] + nums[2]
sort.Ints(nums)
lg := len(nums)
for i := 0; i < lg-2; i++ {
l := i + 1
r := lg - 1
for l < r {
_sum := nums[i] + nums[l] + nums[r]
if _sum == target {
return target
} else if _sum > target {
r--
} else {
l++
}
if math.Abs(float64(_sum-target)) < math.Abs(float64(res-target)) {
res = _sum
}
}
}
return res
}