LeetCode:3Sum Closest
来源:互联网 发布:修复移动硬盘软件 编辑:程序博客网 时间:2024/06/08 02:12
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).
解题思路:
与Three Sum的做法类似,首先枚举中间数字的位置,然后找寻和离target减去中间数字最近的点即可(此处需用绝对值).时间复杂度为O(N^2).
解题代码:
class Solution {public: int threeSumClosest(vector<int> &num, int target) { sort(num.begin(),num.end()); unsigned n = num.size() ; long long res = abs(num[0] + num[1] + num[2] - target) , sum = num[0] + num[1] + num[2] ; for(unsigned i=1;i < n - 1 ;++i) { long long sum1 = target - num[i] ; unsigned j = 0 , k = n - 1 ; while( j < i && k > i ) { long long tmp = num[j] + num[k] ; if(res > min(res,abs(sum1-tmp))) { res = min(res,abs(sum1-tmp)); sum = num[i] + tmp; } if(sum1 == tmp) return sum; tmp > sum1 ? --k : ++j ; } } return sum; }};
0 0
- LeetCode: 3 Sum Closest
- leetcode - 3 sum closest
- leetcode 3Sum Closest
- LeetCode: 3Sum Closest
- [Leetcode]3Sum Closest
- Leetcode: 3SUM Closest
- LeetCode 3Sum Closest
- [Leetcode] 3Sum Closest
- LeetCode : 3Sum Closest
- LeetCode 3Sum Closest
- [LeetCode] 3Sum Closest
- 【leetcode】3Sum Closest
- [LeetCode]3Sum Closest
- LeetCode-3Sum Closest
- LeetCode:3Sum Closest
- LeetCode | 3Sum Closest
- 【leetcode】3Sum Closest
- Leetcode: 3Sum Closest
- Http请求的get 和 post的请求的区别
- DD-OFDM vs CO-OFDM
- Windows内核之进程的终止和子进程
- C++ Primer中文版(第五版)--第三章 字符串、向量和数组
- 又是一个星期五
- LeetCode:3Sum Closest
- hdu-4302-Holedox Eating-线段树-单点更新,有策略的单点查询
- Effective_java之二:慎用重载函数
- 详细图解 Flume介绍、安装配置
- 从零单排PAT1013,1014
- ios--关于子线程发送网络请求接受不到响应问题
- c++指针对象调用成员函数
- SVD 与 PCA 的直观解释(4): PCA 主成分分析
- 按照字节分割字符串