16. 3Sum Closest
- Total Accepted: 101121
- Total Submissions: 333507
- Difficulty: Medium
- Contributors: Admin
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).这题和上一题差不太多,还得先排序,然后左右调试,相当于动态规划。
代码如下:
public class Solution {
public int threeSumClosest(int[] nums, int target) {
if (nums == null||nums.length<3) {
return 0;
}
Arrays.sort(nums);
int ret = nums[0]+nums[1]+nums[2];
int len = nums.length;
for (int i = 0; i<=len-3; i++) {
int j = i+1;
int k = len-1;
while (j < k) {
int sum = nums[i] + nums[j] + nums[k];
if (Math.abs(sum-target)<Math.abs(ret-target)) {
ret = sum;
}
if (sum < target) {
++j;
} else if (sum > target) {
--k;
} else {
++j;
--k;
}
}
}
return ret;
}
}