LeetCode16: 3Sum Closest

问题描述

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

java实现

class Solution {
    public int threeSumClosest(int[] nums, int target) {
       int result=nums[0]+nums[1]+nums[nums.length-1]; //初始化一个result作为标兵
       Arrays.sort(nums);  //排序
       for(int i=0; i<nums.length-2;i++){//比较到倒数第三个
           int pf=i+1; //前面的指针 初始位置为i的下一个位置
           int pe=nums.length-1;//后面的指针初始位置为数组最后的位置
           while(pf<pe){
               int sum=nums[i]+nums[pf]+nums[pe]; //三个数字的和
               //sum - target绝对值小说明sum比result更接近target,所以用sum值替换掉result
               if (Math.abs(sum - target) < Math.abs(result - target)) { 
                    result = sum;
                }
               if(sum<target)
                   pf++; //sum小于target 增大sum更接近target pf指针后移可以增大sum
               else 
                   pe--; //sum大于target 减小sum更接近target pe指针前移可以减小sum
               
           }
       }
       return result;
    }
}