Problem
Given an integer array nums of length n 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 1:
Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
Example 2:
Input: nums = [0,0,0], target = 1
Output: 0
Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
Constraints:
3 <= nums.length <= 500
-1000 <= nums[i] <= 1000
-104 <= target <= 104
Solution
Very much like 3sum, emit the duplicate part, and update res
when abs diff is smaller.
Time complexity:
o
(
n
2
)
o(n^2)
o(n2)
Space complexity:
o
(
1
)
o(1)
o(1)
Code
class Solution:
def threeSumClosest(self, nums: List[int], target: int) -> int:
res = sum(nums[:3])
nums.sort()
for i in range(len(nums) - 2):
left, right = i + 1, len(nums) - 1
while left < right:
s = nums[i] + nums[left] + nums[right]
if abs(s - target) < abs(res - target):
res = s
if s < target:
left += 1
elif s > target:
right -= 1
else:
return s
return res