LeetCode-最接近的三数之和

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.

与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).

package threeSumClosest;

import java.util.Arrays;

public class ThreeSumClosest {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Solution solution = new Solution();
		System.out.println(solution.threeSumClosest(new int[] { 0, 2, 1, -3 }, 1));
	}

}

class Solution {
	public int threeSumClosest(int[] nums, int target) {

		Arrays.sort(nums);
		int result = nums[1] + nums[2] + nums[0];

		int diff = Math.abs(target - result);

		int temp;
		int tempDiff;
	

		//System.out.println(result);
		for (int i = 0; i < nums.length - 2; ++i) 
		{
			int left = i+1;
			int right = nums.length - 1;
			
			while (left < right) {
				temp = nums[i] + nums[left] + nums[right];

				tempDiff = target - temp;
				if (tempDiff > 0) {
					++left;
				} else {
					--right;
				}
				if (diff > Math.abs(tempDiff)) {
					diff = Math.abs(tempDiff);
					result = temp;

				}

				if (diff == 0) {
					break;
				}

				// System.out.println(result);
			}
		}
		return result;

	}
}