leetcode:数组三数之和
这个跟三个数之和一个思路,简单改一下就行了,纯属练习。class Solution: def threeSumClosest(self, nums,target): nums.sort() mind = 9999 for i in range(len(nums)): l = i+1 r = len(nums) - 1 while(l<r): ..