(LeetCode)3Sum Closest
来源:互联网 发布:推荐算法的稀疏性问题 编辑:程序博客网 时间:2024/06/09 05:19
class Solution {public: int threeSumClosest(vector<int> &num, int target) { int ans=0,tmp=0; sort(num.begin(),num.end()); for (int i=0;i<num.size();i++){ int j=i+1; int k=(int)num.size()-1; while(j<k){ tmp=num[i]+num[j]+num[k]; if (i==0&&j==i+1&&k==(int)num.size()-1) ans=tmp; if(abs(tmp-target)<abs(ans-target)) ans=tmp; if(ans==target) return ans; if(tmp>target)k--; else j++; } } return ans; }};
遍历起点另外两个数一个取最小的另一个取最大的然后根据三个数的和和target的关系判断应该变大还是变小。
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
- Spring--ApplicationContext和BeanFactory区别
- guava处理字符串与List之间,字符串与map之间的转换
- windows下使用virtualenv安装scrapy
- JavaScript :: 获取带中文的字符串的长度
- SQL笔记
- (LeetCode)3Sum Closest
- 如何使基于梯度下降的机器学习并行化
- WPF DataGrid自定义样式
- Android开发之ViewPager显示页面切换
- Android 单元测试
- 浏览器输入网址后后台是如何运作的
- LeetCode——Find Minimum in Rotated Sorted Array
- A4纸尺寸说明
- 加州理工学院公开课:机器学习与数据挖掘_神经网络