leetcode-3 sum closest
来源:互联网 发布:零基础学java第3版pdf 编辑:程序博客网 时间:2024/05/16 11:44
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).思路:与3sum类似,排序,先固定其中一个;
判断sum与target的距离distance,距离越小,则更新结果res。
如果sum<target,++p,p指针右移,否则,--q,q指针左移。
代码:
int threeSumClosest(vector<int> &num,int target)
{
int res;
int dist;
int mindist=0xffff;
int len=num.size();
if(len<3)
{
return 0;
}
sort(num.begin(),num.end());
for(int i=0;i<len-2;++i)
{
if(i!=0 && num[i]==num[i-1])
{
continue;
}
int p=i+1;
int q=len-1;
while(p<q)
{
dist=target>(num[i]+num[p]+num[q])?(target-num[i]-num[p]-num[q]):(num[i]+num[p]+num[q]-target);
if(mindist>dist)
{
mindist=dist;
res=num[i]+num[p]+num[q];
}
if(mindist==0)
{
return res;
}
if(target>(num[i]+num[p]+num[q]))
{
++p;
}
else if(target<(num[i]+num[p]+num[q]))
{
--q;
}
}
}
return res;
}
- 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
- 我的面试准备纲要
- 泛型加强
- Android开发之ListView(1)
- OpenVPN解密(二)
- POJ 1321 棋盘问题
- leetcode-3 sum closest
- IOS真机测试教程
- INSTALL_FAILED_INSUFFICIENT_STORAGE 错误
- jsp中jstl fn为啥不能用
- Python-面向对象(三 元编程)
- 用于字符串拼接,字符串重合度以及偏移量算法
- 让CSS的查找匹配原理变高效
- Alpha版本
- TCP/IP协议全部IP协议号