标签：col target number input ber math int 个数 example
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).
求三个数字的和最接近目标值target
1 public int threeSumClosest(int[] nums, int target) { 2 Arrays.sort(nums); 3 int minCount = nums[0] + nums[1] + nums[nums.length-1]; 4 for (int i = 0; i < nums.length; i++) { 5 int low = i + 1, high = nums.length - 1; 6 while (low < high) { 7 int count = nums[i] + nums[low] + nums[high]; 8 if(count > target) 9 { 10 high--; 11 }else 12 { 13 low++; 14 } 15 if (Math.abs(count - target) < Math.abs(minCount - target)) 16 minCount = count; 17 } 18 } 19 return minCount; 20 }
标签：col target number input ber math int 个数 example
原文地址：http://www.cnblogs.com/wzj4858/p/7675384.html
