[leetcode] 16 3Sum Closet
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 exactly...
原创
2018-03-12 15:12:24 ·
180 阅读 ·
0 评论