LeetCode 16. 3sum Closest（第八周Ⅱ）

题目：

Given an array nums of n integers 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:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

思路 & 代码：

在列表中找出与目标数最接近的三个数的和。

将列表用sort()函数由小到大排好序。设置三个变量i, j, k，做一层循环，i from 0 to n - 3，初始值：j = i + 1，k = n - 1，nums[i]、nums[j]、nums[k]三者的和sum与target作差取绝对值进行比较，留下最接近的；若sum == target，直接返回target；在 j < k 的前提下，sum > target，k -= 1，反之，j += 1；若程序运行至遍历结束，则返回留下的最接近的值。

另. 遍历时除第一次外每次检查 nums[i] 是否与列表中前一个数相同，避免重复工作。

class Solution:
def threeSumClosest(self, nums, target):
nums.sort()
#print(nums)
n = len(nums)
#print(n)
closest = float('inf')
for i in range(n - 2):
#print(i)
if i > 0 and nums[i] == nums[i - 1]:
continue
j = i + 1
k = n - 1
'''
while nums[i] >= 0 and nums[k] > target:
if k == j + 1:
break
else: k = k - 1
'''
while j < k:
#print(j, k)
sum = nums[i] + nums[j] + nums[k]
if sum == target: return target
else: 
if abs(sum - target) <= abs(closest - target):
closest = sum
if sum > target:
k = k - 1
else: j = j + 1
return closest


sol = Solution()
nums = [-55,-24,-18,-11,-7,-3,4,5,6,9,11,23,33]
target = 0
print(sol.threeSumClosest(nums, target))