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

>>阅读原文<<