LeetCode T16 3Sum Closest

题目地址：

中文：https://leetcode-cn.com/problems/3sum-closest/
英文：https://leetcode.com/problems/3sum-closest/

题目描述：

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 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Constraints:

3 <= nums.length <= 10^3
-10^3 <= nums[i] <= 10^3
-10^4 <= target <= 10^4

思路：

跟上一题类似，一个固定指针，两个移动指针的思路。

题解：

class Solution {
	   public static int threeSumClosest(int[] nums, int target) {
	    Arrays.sort(nums);
	    int i;
	    int j;
	    int k=0;
	    int res = 0;
	    int closest=10000;
	    while(k<nums.length-2){
	        i=k+1;
	        j=nums.length-1;
	        //System.out.println(i+" "+j+" "+k+" "+nums[i]+" "+nums[j]+" "+nums[k]+" "+closest);
	        while (i<j){
	            if(nums[i]+nums[j]+nums[k]<target) {
	                if (Math.abs(nums[i] + nums[j] + nums[k] - target) < closest) {
	                    res = nums[i] + nums[j] + nums[k];
	                    closest = Math.abs(nums[i] + nums[j] + nums[k] - target);
	                }
	                i++;
	            }
	            else {
	                if (Math.abs(nums[i] + nums[j] + nums[k] - target) < closest) {
	                    res = nums[i] + nums[j] + nums[k];
	                    closest = Math.abs(nums[i] + nums[j] + nums[k] - target);
	                }
	                j--;
	            }
	        }
	        k++;
	    }
	    return res;
	}
}