题目链接
法一
public int threeSumClosest(int[] nums, int target) {
int ans = Integer.MAX_VALUE;
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
int left = i + 1, right = nums.length - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
ans = Math.abs(ans - target) < Math.abs(sum - target) ? ans : sum;
if (sum < target) {
left++;
} else if (sum > target) {
right--;
} else {
return ans;
}
}
}
return ans;
}
本地测试
lay.showTitle(16);
Solution16 sol16 = new Solution16();
int[] nums16 = new int[]{-1,2,1,-4};
System.out.println(sol16.threeSumClosest(nums16, 1));