3Sum Closest
来源:互联网 发布:淘宝卖aj的正品店 编辑:程序博客网 时间:2024/06/11 14:30
原题链接
给含有n个元素的数组S,寻找出S中的三个元素,使其求和接近于所给的数字,target。并且返回这三个元素之和。你应该假设每一个输出只有一个确切的答案
例如, 所给数组为 S = {-1 2 1 -4}, 并且目标数字target = 1.那么最接近目标数字的和是2. (-1 + 2 + 1 = 2).
public class Solution { public int threeSumClosest(int[] num, int target) { int result = num[0] + num[1] + num[num.length - 1]; Arrays.sort(num); for (int i = 0; i < num.length - 2; i++) { int start = i + 1, end = num.length - 1; while (start < end) { int sum = num[i] + num[start] + num[end]; if (sum > target) { end--; } else { start++; } if (Math.abs(sum - target) < Math.abs(result - target)) { result = sum; } } } return result; }}
阅读全文
0 0
- 3 Sum & 3 Sum Closest
- 【Leetcode】3Sum Closest (Sum)
- LeetCode: 3 Sum Closest
- 3Sum Closest
- leetcode - 3 sum closest
- leetcode 3Sum Closest
- LeetCode: 3Sum Closest
- [Leetcode]3Sum Closest
- Leetcode: 3SUM Closest
- LeetCode 3Sum Closest
- [Leetcode] 3Sum Closest
- leetcode002:3sum closest
- LeetCode : 3Sum Closest
- LeetCode 3Sum Closest
- 3Sum Closest
- 3Sum Closest
- 3Sum Closest
- [LeetCode] 3Sum Closest
- 初始化EHcache CacheManager时报java.net.UnknownHostException
- QT中eventFilter的使用方法
- Python入门——数据类型
- 使用QT来绘制MAT
- C++11的强类型枚举
- 3Sum Closest
- Fileshopping
- RPFS(RP First Search) 模拟退火算法 未完
- easyui datagrid 添加操作列时设计到rowdata传参问题
- Wannafly 牛客网 挑战赛2 A
- PullToRefreshListView
- 【bzoj 2044】三维导弹拦截(网络流)(拓扑排序)
- Sklearn-train_test_split随机划分训练集和测试集
- leetcode 25. Reverse Nodes in k-Group