Skip to content

Commit a54a770

Browse files
committed
add LeetCode 16. 最接近的三数之和
1 parent 55cc3d7 commit a54a770

File tree

1 file changed

+78
-0
lines changed

1 file changed

+78
-0
lines changed
Lines changed: 78 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,78 @@
1+
![](https://imgconvert.csdnimg.cn/aHR0cHM6Ly9jZG4uanNkZWxpdnIubmV0L2doL2Nob2NvbGF0ZTE5OTkvY2RuL2ltZy8yMDIwMDgyODE0NTUyMS5qcGc?x-oss-process=image/format,png)
2+
>仰望星空的人,不应该被嘲笑
3+
4+
## 题目描述
5+
给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数,使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。
6+
7+
8+
9+
示例:
10+
11+
```javascript
12+
输入:nums = [-1,2,1,-4], target = 1
13+
输出:2
14+
解释:与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。
15+
```
16+
17+
18+
提示:
19+
20+
- 3 <= nums.length <= 10^3
21+
- -10^3 <= nums[i] <= 10^3
22+
- -10^4 <= target <= 10^4
23+
24+
来源:力扣(LeetCode)
25+
链接:https://leetcode-cn.com/problems/3sum-closest
26+
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
27+
28+
29+
## 解题思路
30+
31+
这道题和15有一点区别,我们只要求最接近 `target` 的三树之和,那么我们就需要每次更新一下,最接近的和,简单来说就是比较一下,然后本题也没有去重操作,相对来说考虑情况会更少一点。
32+
```javascript
33+
/**
34+
* @param {number[]} nums
35+
* @param {number} target
36+
* @return {number}
37+
*/
38+
var threeSumClosest = function (nums, target) {
39+
let len = nums.length;
40+
nums.sort((a, b) => a - b); // 从小到大进行排序
41+
let res = nums[0] + nums[1] + nums[len - 1]; // 初始化随机一个res
42+
for (let i = 0; i < len - 2; i++) {
43+
let L = i + 1;
44+
let R = len - 1;
45+
while (L < R) {
46+
let sum = nums[i] + nums[L] + nums[R]; // 三数之和
47+
sum > target ? R-- : L++; // 比目标值大,就往左内缩,小的话,就往右内缩
48+
if (Math.abs(sum - target) < Math.abs(res - target)) {
49+
res = sum; // 迭代更新res
50+
}
51+
}
52+
}
53+
return res;
54+
};
55+
```
56+
57+
58+
## 最后
59+
文章产出不易,还望各位小伙伴们支持一波!
60+
61+
往期精选:
62+
63+
<a href="https://github.com/Chocolate1999/Front-end-learning-to-organize-notes">小狮子前端の笔记仓库</a>
64+
65+
<a href="https://github.com/Chocolate1999/leetcode-javascript">leetcode-javascript:LeetCode 力扣的 JavaScript 解题仓库,前端刷题路线(思维导图)</a>
66+
67+
小伙伴们可以在Issues中提交自己的解题代码,🤝 欢迎Contributing,可打卡刷题,Give a ⭐️ if this project helped you!
68+
69+
70+
<a href="https://yangchaoyi.vip/">访问超逸の博客</a>,方便小伙伴阅读玩耍~
71+
72+
![](https://img-blog.csdnimg.cn/2020090211491121.png#pic_center)
73+
74+
```javascript
75+
学如逆水行舟,不进则退
76+
```
77+
78+

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy