[LeetCode]16. 3Sum Closest
来源:互联网 发布:毒药超女网络海选 编辑:程序博客网 时间:2024/05/01 06:26
16. 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1.The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
分析
k-Sum系列问题的扩展,解题思路还是先排序,然后选定一个数后,在这个选定数后续序列里通过两端夹逼的方式遍历剩下的两个数的组合,遍历过程中记录最接近target的和即可
源码
class Solution {public: // 排序 两边夹逼 int threeSumClosest(vector<int>& nums, int target) { int ret; int gap = INT_MAX; sort(nums.begin(), nums.end()); for(int i = 0; i < nums.size() - 2; i++) { int j = i + 1; int k = nums.size() - 1; while(j < k) { int sum = nums[i] + nums[j] + nums[k]; int tmp_gap = abs(sum - target); if(tmp_gap < gap) { ret = sum; gap = tmp_gap; } if(sum > target) k--; else j++; } } return ret; }};
0 0
- LeetCode 16. 3Sum Closest
- LeetCode --- 16. 3Sum Closest
- [Leetcode] 16. 3Sum Closest
- 【leetcode】16. 3Sum Closest
- [leetcode] 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- LeetCode - 16. 3Sum Closest
- [LeetCode]16. 3Sum Closest
- LeetCode 16. 3Sum Closest
- LeetCode *** 16. 3Sum Closest
- Leetcode 16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 【LeetCode】16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 【leetcode】16. 3Sum Closest
- leetcode 16. 3Sum Closest
- 指针和引用
- 前端面试题整理——CSS篇
- 004--栈、队列
- 36.Swing事件处理
- i2c例程 简单易懂
- [LeetCode]16. 3Sum Closest
- 学习
- MySql-使用触发器(trigger)
- 第八届郑州轻工业学院ACM程序设计大赛校内预选赛
- c++第三次实验—作业
- 给定两个字符串,判断他们是否是彼此可置换的
- 广东工业大学2016校赛 Problem E: 积木积水
- gdutProblem E: 积木积水
- SMTP协议错误代码及原因