Description
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
Code
class Solution(object):
def threeSumClosest(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
res, resCnt = sys.maxint, sys.maxint
nums.sort()
for i in xrange(len(nums) - 2):
if i > 0 and nums[i] == nums[i - 1]:
continue
l, r = i + 1, len(nums) - 1
while l < r:
s = nums[i] + nums[l] + nums[r]
cnt = abs(target - s)
if cnt == 0:
return s
if s < target:
l += 1
else:
r -= 1
if cnt < resCnt:
res, resCnt = s, cnt
return res
Conclusion
这道题完全是照着3sum改来的,没想到beat 94%了,哈哈哈哈。当初那题只beat 了33%,估计这次是系统超长发挥,给我快速运算完了。不过,又提交了一次,还是90%以上,哈哈哈。可以。