Leetcode【16】:3Sum Closest
来源:互联网 发布:苏联打阿富汗知乎 编辑:程序博客网 时间:2024/05/17 09:20
题目:和上题思路类似,但是细节稍有区别。此题要求找到3个数的和最接近一个target,并且假设只有一个结果。比如我们找到了3个数之和正好==target,就可以结束了。
class Solution {public:int threeSumClosest(vector<int> &num, int target){if(num.size()==3)return num[0]+num[1]+num[2];sort(num.begin(),num.end());//先排序。int res=100000;for(int i=0;i<num.size();++i){//两层循环int start=i+1,end=num.size()-1;while(start<end){int sum=num[start]+num[end]+num[i];int tmp=sum-target;if(abs(tmp)<abs(res-target))res=sum;//如果需要更新结果的话if(tmp>0)end--;else if(tmp<0)start++;else {res=target;break;}}if(res==target)break;//如果正好找到和==target}return res;}};
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) 3 Sum Closest
- LeetCode 16 - 3Sum Closest
- leetcode 16 -- 3Sum Closest
- 3Sum Closest - LeetCode 16
- leetcode 16: 3Sum Closest
- Leetcode#16 3Sum Closest
- LeetCode(16) 3Sum Closest
- LeetCode #16 3Sum Closest
- Linking Containers Together
- Vakuum开发笔记02 核心与安全问题
- 淘宝IP库应用
- tomcat启动一闪而过
- noip2005 一维采药---非恰 (01背包)
- Leetcode【16】:3Sum Closest
- Android Fragments 详细使用
- vc环境下libssh编译
- 约瑟环问题的数组实现
- 微信订餐系统怎么建设?
- input与select在不同浏览器上的宽度显示不同
- 018
- OS X Mountain Lion 系统配置 Apache+Mysql+PHP 详细教程
- Codeforces Round #261 (Div. 2)(树状数组,dp,dfs构造序列)