首页 > 代码库 > [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).
Solution:
public class Solution { public int threeSumClosest(int[] num, int target) { Arrays.sort(num); int result=num[0]+num[1]+num[2]; for (int i = 0; i < num.length - 2; ++i) { int low=i+1; int high=num.length-1; while(low<high){ int sum = num[low]+num[high]+num[i]; if(Math.abs(result-target)>Math.abs(sum-target)){ result=sum; } if(sum<target) low++; if(sum>target) high--; if(sum==target){ return sum; } } } return result; }}
[Leetcode] 3Sum Closest
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。