解题方案:
var threeSumClosest = function(nums, target) {
nums.sort(function(a,b){
return a-b;
});
var minNum = nums[0]+nums[1]+nums[2];
for(let i=0;i<nums.length-2;i++){
let j=i+1;
let z=nums.length-1;
while(j<z){
if(Math.abs(minNum-target)>Math.abs(nums[i]+nums[j]+nums[z]-target)){
minNum = nums[i]+nums[j]+nums[z];
}
if(nums[i]+nums[j]+nums[z]==target){
return nums[i]+nums[j]+nums[z];
}else if(nums[i]+nums[j]+nums[z]>target){
z--
}else if(nums[i]+nums[j]+nums[z]<target){
j++
}
}
}
return minNum;
};
解题思路:
1、先将整个数组进行排序,然后声明一个接近值的初始值;
2、循环遍历整个数组,循环中利用双指针,判断是否获得了更接近的接近值;
3、输出这个最接近值;