【leetcode】【中等】16. 最接近的三数之和【三指针移动】

题目概述：

---

题目注意点：

---

解题思路：

我就没看懂。。算了。。。跳过

---

完整代码：

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums, r, end = sorted(nums), float('inf'), len(nums) - 1
        for c in range(len(nums) - 2):
            i, j = max(c + 1, bisect.bisect_left(nums, target - nums[end] - nums[c], c + 1, end) - 1), end
            while r != target and i < j:
                s = nums[c] + nums[i] + nums[j]
                r, i, j = min(r, s, key=lambda x: abs(x - target)), i + (s < target), j - (s > target)
        return r

评论地址：
https://leetcode-cn.com/problems/3sum-closest/comments/71482