LeetCode[Array]----3Sum Closest

3Sum Closest

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

class Solution(object):
def threeSumClosest(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
dmin = float('inf')
nums.sort()
for i in range(len(nums) - 2):
left = i + 1
right = len(nums) - 1
while left < right:
nsum = nums[left] + nums[right] + nums[i]
if abs(nsum - target) < abs(dmin):
dmin = nsum - target
minsum = nsum
if nsum > target:
right -= 1
if nsum < target:
left += 1
if nsum == target:
return nsum
return minsum

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客