LeetCode刷題筆記（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

>>阅读原文<<