leetcode16

 1 import sys
 2 class Solution:
 3     def threeSumClosest(self, nums: 'List[int]', target: int) -> int:
 4         n = len(nums)
 5         if n <= 3:
 6             return sum(nums)
 7         nums = sorted(nums)
 8         mindiff = sys.maxsize
 9         minsums = 0
10         for i in range(n-2):
11             j,k = i + 1,n - 1
12             while j < k:
13                 sums = nums[i] + nums[j] + nums[k]
14                 diff = sums - target
15                 if diff == 0:
16                     return target
17                 elif diff < 0:
18                     j += 1
19                 else:
20                     k -= 1
21                 if abs(diff) < mindiff:
22                     mindiff = abs(diff)
23                     minsums = sums
24         return minsums

 

转载于:https://www.cnblogs.com/asenyang/p/11105099.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值