leetcode解题之 16. 3Sum Closest Java版（结果离目标值最近三个数字和）

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

给定一个数组和目标元素，找出数组中的3个元素使其和最接近目标元素。首先对给定的数组进行排序，然后从0到数组元素长度len-2开始循环，对于每层循环，定义两个指针一个begin指向i+1,end指向数组的尾部，然后开始判断i,begin和end指向的元素之和是否更接近给定的元素，如果接近则更新，然后判断3个元素的和是大于给定的元素还是小于给定的元素，大于的话begin指针加1，小于的话end指针减1；

参考：3sum

public int threeSumClosest(int[] nums, int target) {
		if (nums == null || nums.length < 3)
			return 0;
		int len = nums.length;
		Arrays.sort(nums);
		// closest始终大于等于0！
		int closest = Integer.MAX_VALUE;
		int ret = 0;
		for (int i = 0; i < len; i++) {
			if (i > 0 && nums[i] == nums[i - 1])
				continue;
			// 往后找，避免重复
			int begin = i + 1;
			int end = len - 1;

			while (begin < end) {
				System.out.println(begin);
				int sum = nums[i] + nums[begin] + nums[end];

				if (sum > target) {

					if (sum - target < closest) {

						closest = sum - target;
						ret = sum;
					}
					end--;
				} else if (sum < target) {

					if (-sum + target < closest) {
						closest = -sum + target;
						ret = sum;
					}
					begin++;
				} else
					return target;

			}
		}
		return ret;
	}