3Sum Closest
Given an integer array nums of length n and an integer target, find three integers at distinct indices in nums such that their sum is closest to target.
Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example 1
Input
nums = [-1,2,1,-4], target = 1Output
2The sum closest to 1 is 2, formed by -1 + 2 + 1.
Example 2
Input
nums = [0,0,0], target = 1Output
0The only possible triplet has sum 0, which is closest to 1.
Constraints
- 3 <= nums.length <= 500
- -1000 <= nums[i] <= 1000
- -10^4 <= target <= 10^4