leetcode之3Sum Closest 問題

題目： Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa

>>阅读原文<<