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).Subscribe to see which companies asked this question
package leetcode; import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * @author Mouse * */ public class Solution { public static int threeSumClosest(int[] nums, int target) { if (nums == null || nums.length < 3) return nums[0] + nums[1]; Arrays.sort(nums);// 给nums排序 int min = nums[0] + nums[1] + nums[2]; for (int i = 0; i < nums.length; i++) { int left = i + 1; int right = nums.length - 1; while (left < right) { int sum = nums[left] + nums[right] + nums[i]; int differ1 = sum - target; differ1 = differ1 > 0 ? differ1 : -differ1; int differ2 = min - target; differ2 = differ2 > 0 ? differ2 : -differ2; if (differ1 < differ2) { min = sum; } if (sum < target) { left++; } else { right--; } } } return min; } public static void main(String[] args) { // 1, 1, 1, 0 -100 // 0,2,1,-3 1 int[] nums = { 0, 2, 1, -3 }; int a = threeSumClosest(nums, 1); System.out.println(a); } }
