IncredibleThings

导航

2016年7月22日 #

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 exactl... 阅读全文

posted @ 2016-07-22 02:07 IncredibleThings 阅读(128) 评论(0) 推荐(0) 编辑