= [0,0,0], target = 1 Output: 0 Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).

Solution

This problem is similar to 2 Sum.

Method 1 - Sorting with 2 Pointer Approach

This kind of problem can be solved by using a similar approach, i.e., two pointers from both left and right.

Code

[{"language":"Java","code":"public int threeSumClosest(int[] nums, int target) {\n    int min = Integer.MAX_VALUE;\n    int result = 0;\n\n    Arrays.sort(nums);\n\n    for (int i = 0; i < nums.length; i++) {\n        int j = i + 1;\n        int k = nums.length - 1;\n        while (j < k) {\n            int sum = nums[i] + nums[j] + nums[k];\n            int diff = Math.abs(sum - target);\n\n            if (diff == 0) return sum;\n\n            if (diff < min) {\n                min = diff;\n                result = sum;\n            }\n            if (sum <= target) {\n                j++;\n            } else {\n                k--;\n            }\n        }\n    }\n\n    return result;\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> threeSumClosest</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] nums, </span><span style=\"color:#D73A49;-

Related Tags