Fork me on GitHub
2018年4月8日
算法题丨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 intege 阅读全文
posted @ 2018-04-08 10:30 Lancel0t 阅读(273) 评论(0) 推荐(0)
算法题丨3Sum
摘要： 描述 Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum 阅读全文
posted @ 2018-04-08 10:16 Lancel0t 阅读(231) 评论(0) 推荐(0)
算法题丨Two Sum
摘要： 描述 Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have 阅读全文
posted @ 2018-04-08 10:09 Lancel0t 阅读(274) 评论(0) 推荐(0)