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 {
    int twoSumClosest(int[] nums, int target, int firstnum){
        int left,right;
        int closest = nums[firstnum+1]+nums[firstnum+2]-target;
        int cur;
        for(left = firstnum+1, right = nums.length-1; right < nums.length && left < right; ){
            cur = nums[left]+nums[right]-target;
            if(Math.abs(cur) < Math.abs(closest)){
                closest = cur;
            }
            if( cur < 0){
                ++left;
            }else if(cur > 0){
                --right;
            }else if(cur == 0){
                return 0;
            }
        }
        return closest;
    }
   
    public int threeSumClosest(int[] nums, int target){
        Arrays.sort(nums);
        int firstnum;
        int cur;
        int closest = nums[0]+nums[1]+nums[2]-target;
        for(firstnum = 0; firstnum < nums.length-2; ++firstnum){
            cur = twoSumClosest(nums,target-nums[firstnum],firstnum);
            if(Math.abs(cur) < Math.abs(closest)){
                closest = cur;
                System.out.println(target-nums[firstnum]);
                System.out.println(closest);
            }
        }
        return closest+target;
    }
}