编程语言:Java
题目链接:https://leetcode-cn.com/problems/3sum-closest/
题解:最开始是暴力的,看了题解觉得自己是**
难度:Medium
结果:
class Solution {
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int res = nums[0] + nums[1] + nums[2];
for (int i = 0; i < nums.length; i++) {
int start = i + 1, end = nums.length - 1;
while (start < end) {
int sum = nums[i] + nums[start] + nums[end];
if (Math.abs(target - res) > Math.abs(target - sum))
res = sum;
if (sum > target)
end--;
else if (sum < target)
start++;
else
return sum;
}
}
return res;
}
}