leetcode 16. 3Sum Closest

今日份LeetCode 16. 3Sum Closest
Description:
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).

题目是要找到数组中三个元素，使它们的和与target最近接。
用三个for循环暴搜的方法就不说了，时间复杂度太高，为O（n^3）。
为了将复杂度将为O(n^2)，可以先将数组排序，采用双指针的方式。外层for循环i从0开始到nums.length-2，start指针等于i+1从数组左边开始，end指针从数组最右边开始。当nums[i]+nums[start]+nums[end]>target让start往右移，缩小与target的差距，反之end左移。此外还需要一个变量result来记录目前最靠近target的值。

class Solution {
    public int threeSumClosest(int[] nums, int target) {                
        int result = nums[0]+nums[1]+nums[2];  
        Arrays.sort(nums);     
        for(int i=0;i<nums.length-2;i++){   //可以将i也看做一个指针，那就成了三指针
            int start = i+1;  
            int end = nums.length-1;
            while(start<end){
                int sum = nums[i]+nums[start]+nums[end];
                if(sum==target)
                    return target;
                else if(sum<target)
                    start++;
                else              
                    end--;
                if(Math.abs(sum-target)<Math.abs(result-target))
                    result=sum;
            }
        }
        return result;
    }
}