LeetCode刷题系列_16题

题目要求：
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 int threeSumClosest(int[] nums, int target) {
        int length = nums.length;
        int sum = 0;
        int min = 10000;
        int minIndex = 0;
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i=0;i<length;i++) {
            sum = sum + nums[i];
            int gap = Math.abs(target - sum);
            map.put(i, sum);
            if(gap < min) {
                min = gap;
                minIndex = i;
            }
        }
        return map.get(minIndex);
    }

既然是三个数字加和，那么leetcode十五题的解题路子完全可以借鉴过来，接下来看一下如何用三个数字来实现：

    public int threeSumClosest(int[] nums, int target) {
        int length = nums.length;
        int sum = 0;
        int min = 99999999;
        List<Integer> list = new ArrayList<Integer>();
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        Arrays.sort(nums);
        for(int i=0;i<length;i++) {
            int begin = i+1;
            int end = nums.length-1;
            while(begin<end) {
                sum = nums[i] + nums[begin] + nums[end];
                if(sum == target ) {
                    return sum;
                } else if(sum < target) {
                    begin++;
                } else {
                    end--;
                }
                //在这注意以下是绝对值的比较，在这吃了憋，浪费我不少时间。。
                if(Math.abs(min-target) > Math.abs(sum-target)) {
                    min = sum;
                }
            }
        }
        return min;
    }