【leetcode】16. 3Sum Closest

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.

>For 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).

跟3Sum很像。排序之后可以减少复杂度，复杂度最高位o(n2)

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var threeSumClosest = function(nums, target) {
    var cmp = function(a,b){
        return a>b?1:-1;
    };
    var res;
    var min_dis = Number.POSITIVE_INFINITY;
    nums.sort(cmp);
    var ll = nums.length;
    for(i=0;i<ll;i++){
      if(i>0&&nums[i]===nums[i-1]){
          continue;
      }  
      var j = i+1;
      var k = ll-1;
      while(j<k){
          var sum = nums[i]+nums[j]+nums[k];
          var diff = Math.abs(sum-target);
          if(diff<min_dis){
              min_dis = diff;
              res = sum;
          }
          if(target>sum){
              j++;
          }else{
              k--;
          }
      }
    }
    return res;
};