先看题目:
刚刚看完题目,觉得比较简单,觉得这个就直接写两个变量,先是内部比一下,然后再写一个变量, 将每次内部的值和外部比一下,感觉就ok。结果很打脸,因为是3个数,还是没有那么的快速搞定。
后面转念一想,之前做过那么多字符串递归回溯的,我可以穷举出每3个字符串,然后求和,和target值比较,找出差值最小,其中,中间可能还需要用map缓存一想每个数组的和作为key,然后将与target的差值作为value。想的可真麻烦。我还真的去尝试了,无果
public int threeSumClosest(int[] nums, int target) {
int result = 65535;
List<Integer> list = new ArrayList<>();
for (int i = 0; i < nums.length; i++) {
list.add(nums[i]);
threeSumClosestHelp(nums, target, 0, list, result);
}
return result;
}
public int threeSumClosestHelp(int[] nums, int target, int index, List<Integer> list, int result) {
if (index == 3) {
int temp = list.stream().mapToInt(x -> x).sum();
result = Math.min(result, temp - target);
new ArrayList<>(list);
}
threeSumClosestHelp(nums, target, index+1, list, result);
list.remove(list.size() - 1);
return result;
}
写的很挫。然后去看大佬的代码:豁然开朗
https://leetcode-cn.com/problems/3sum-closest/solution/hua-jie-suan-fa-16-zui-jie-jin-de-san-shu-zhi-he-b/
https://www.cnblogs.com/grandyang/p/4510984.html
于是,自己看完思路之后,觉得很巧妙啊,虽然是3个数,先固定一个nums[i],然后去变换头和尾,然后不断的缩小范围,找到最接近的。
public int threeSumClosestSolved(int[] nums, int target) {
Arrays.sort(nums);
int sum = nums[0] + nums[1] + nums[2];
int ans = sum;
for (int i = 0; i < nums.length; i++) {
int left = i + 1;
int right = nums.length - 1;
while (left < right) {
sum = nums[i] + nums[left] + nums[right];
if (Math.abs(sum - target) < Math.abs(ans - target)) {
ans = sum;
}
if (sum < target) {
left++;
} else {
right--;
}
}
}
return ans;
}