首页 > itarticle > [leetcode] problem 16 – 3sum closest

[leetcode] problem 16 – 3sum closest

admin 11月 13, 2020 0

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

Code

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

    for (int i = 0; i < nums.length - 2; i++) {
        int left = i + 1;
        int right = nums.length - 1;

        while (left < right) {
            int sum = nums[i] + nums[left] + nums[right];
            result = Math.abs(target - sum) < Math.abs(target - result) ? sum : result;

            if (sum < target)
                left++;
            else
                right--;
        }
    }

    return result;
}