leetcode-16. 最接近的三数之和

题目：https://leetcode-cn.com/problems/3sum-closest/

答案：

public int threeSumClosest(int[] nums, int target) {

  Arrays.sort(nums);

        int len = nums.length;

        int treeNum = nums[0]+nums[1]+nums[2];

        int minNum = Math.abs(target-treeNum);

        for(int i=0;i<len-2;i++){

           if(i>0 && nums[i] == nums[i-1]) continue;

           for(int j=i+1;j<len-1;j++){

               if(j>i+1 && nums[j] == nums[j-1]) continue;

               for(int k=j+1;k<len;k++){

                   if(k>j+1 && nums[k] == nums[k-1]) continue;

                   if(Math.abs(nums[i]+nums[j]+nums[k]-target)<minNum){

                       treeNum = nums[i]+nums[j]+nums[k];

                       minNum = Math.abs(target-treeNum);

                   }

               }

           }

        }

        return treeNum;

    }

双指针：

 public int threeSumClosest(int[] nums, int target) {

        Arrays.sort(nums);

        int n = nums.length;

        int best = nums[0] + nums[1] + nums[2];

        for (int i = 0; i < n; ++i) {

            if (i > 0 && nums[i] == nums[i - 1]) {

                continue;

            }

            int j = i + 1, k = n - 1;

            while (j < k) {

                int sum = nums[i] + nums[j] + nums[k];

                if (sum == target) {

                    return target;

                }

                // 根据差值的绝对值来更新答案

                if (Math.abs(sum - target) < Math.abs(best - target)) {

                    best = sum;

                }

                if (sum > target) {

                    int k0 = k - 1;

                    // 移动到下一个不相等的元素

                    while (j < k0 && nums[k0] == nums[k]) {

                        --k0;

                    }

                    k = k0;

                } else {

                    // 如果和小于 target，移动 b 对应的指针

                    int j0 = j + 1;

                    // 移动到下一个不相等的元素

                    while (j0 < k && nums[j0] == nums[j]) {

                        ++j0;

                    }

                    j = j0;

                }

            }

        }

        return best;

    }