16. 3Sum Closest leetcode java

1.题目

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

2.思路

和3sum差不多，甚至更简单。先排序，做一个for循环，遍历数组中的每个数字，与3sum相比，因为题目默认答案只有一个，所以可以不对数组做去重处理。对于nums[i],从i+1和nums.length-1的范围去找两个数看这三个数相加的情况，分两种情况，如果sum>target，那么end--,反之start++，如果恰好相等，那么直接return这个sum就是最优解，因为此时dif=0.

3.程序

class Solution {
    public int threeSumClosest(int[] nums, int target) {
		Arrays.sort(nums);
		int start,end,sum,dif,res;
		dif=Integer.MAX_VALUE;
		res=0;
		for(int i=0;i<nums.length;i++) {
			start=i+1;
			end=nums.length-1;
			while(start<end) {
				sum=nums[i]+nums[start]+nums[end];
				if(sum>target) {
					if(dif>sum-target) {
						dif=sum-target;
						res=sum;
					}
					end--;
				}
				else if(sum<target) {
					if(dif>target-sum) {
						dif=target-sum;
						res=sum;
					}
					start++;	
				}
				else {
					res=sum;
					return res;
				}
			}
		}
		return res;        
    }
}