Problem
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.Example
given array S = {-1 2 1 -4}, and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).JavaScript Code
function threeSumClosest(num, target) { var min = 9007199254740992; var result = 0; num.sort(); for (var i = 0; i < num.length; i++) { var j = i + 1; var k = num.length - 1; while (j < k) { var sum = num[i] + num[j] + num[k]; var diff = Math.abs(sum - target); if(diff == 0) return 0; if (diff < min) { min = diff; result = sum; } if (sum <= target) { j++; } else { k--; } } } return result; } console.log(threeSumClosest([-1,2,1,-4], 1));
0 comments:
Post a Comment