首页 > 代码库 > 【LeetCode】3Sum Closest 解题报告
【LeetCode】3Sum Closest 解题报告
【题目】
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解题报告 非常像,与之不同的是,不再是求三个数的和是不是为0,而是看三个数的和与target的差是否为最小,仅仅需记录当前最优解并不断更新其值就可。
【Java代码】O(n^2)
public class Solution { public int threeSumClosest(int[] num, int target) { if (num == null || num.length < 3) return 0; Arrays.sort(num); int ret = 0; int closestDist = Integer.MAX_VALUE; int len = num.length; for (int i = 0; i < len-2; i++) { if (i > 0 && num[i] == num[i-1]) continue; int l = i+1, r = len-1; while (l < r) { int sum = num[i] + num[l] + num[r]; if (sum < target) { if (target-sum < closestDist) { closestDist = target - sum; ret = sum; } l++; } else if (sum > target) { if (sum-target < closestDist) { closestDist = sum - target; ret = sum; } r--; } else { //when sum == target, return sum. return sum; } } } return ret; } }
easy出错的地方是。把 ret 初始值设为 Integer.MAX_VALUE。然后后面计算 closestDist = Math.abs(ret - target),这样会导致溢出!。
【LeetCode】3Sum Closest 解题报告
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。