[LeetCode] 3Sum Closest, Solution
摘要:
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.... 阅读全文
posted @ 2013-01-26 06:05
小刀初试
阅读(149)
评论(0)
推荐(0)
浙公网安备 33010602011771号