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

代码：

package solution;

import java.util.Arrays;

public class Solution16 {
    public static 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 j = i+1, k = nums.length-1;
            while(jtarget){
                    k--;
                }
                else{
                    j++;
                }
                if (Math.abs(sum - target) < Math.abs(result - target)) {
                    result = sum;
                }
            }
        }
        return result;
    }
    public static void main(String[] args){
        int[] a = new int[] {-1,2,1,-4};
        int b = 1;
        System.out.println(threeSumClosest(a,b));
    }
}