题目:3Sum 最相近的3个数字的和
难度:中等
Given an array nums
of n integers and an integer target
, find three integers in nums
such that the sum is closest to target
. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
题意解析:
给定一个包括 n 个整数的数组 nums
和 一个目标值 target
。找出 nums
中的三个整数,使得它们的和与 target
最接近。返回这三个数的和。假定每组输入只存在唯一答案。
例如,给定数组 nums = [-1,2,1,-4], 和 target = 1.
与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
解题思路一:
为方便操作,我们同理对数组进行排序,然后以第一个为基准元素作为循环条件,依次以循环元素的下一个和最后一个作为左元素和右元素遍历,直到找到最接近目标元素的值。
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int rt = nums[0] + nums[1] + nums[2];
int rs = Math.abs(target - rt);
int len = nums.length;
for (int i = 0; i < len; i++) {
int l = i + 1, r = len - 1;
while (l < r){
int temp = nums[i] + nums[l] + nums[r];
if (temp == target){
return target;
}else if (temp > target){
if (Math.abs(target - temp) < rs ){
rs = Math.abs(target - temp);
rt = temp;
}
r--;
}else {
if (Math.abs(target - temp) < rs ){
rs = Math.abs(target - temp);
rt = temp;
}
l++;
}
}
}
return rt;
}
此算法时间复杂度O(n²)
提交代码之后:
Runtime: 4 ms, faster than 99.18% of Java online submissions for 3Sum Closest.
Memory Usage: 37.5 MB, less than 85.62% of Java online submissions for 3Sum Closest.