LeetCode题解：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).

题意：求给定数组中，相加结果与给定整数最接近的三个整数

解决思路：先将数组变成有序，然后双指针算呗……

代码：

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int result = nums[0] + nums[1] + nums[nums.length - 1];

        Arrays.sort(nums);

        for(int i = 0; i < nums.length - 2; i++){
            int left = i + 1;
            int right = nums.length - 1;

            while(left < right){
                int sum = nums[i] + nums[left] + nums[right];

                if(sum > target){
                    right--;
                }else{
                    left++;
                }

                if(Math.abs(sum - target) < Math.abs(result - target)){
                    result = sum;
                }
            }
        }

        return result;
    }
}