- 博客(2)
- 资源 (4)
- 收藏
- 关注
原创 [LintCode]k Sum II
Given n unique integers, number k (1<=k<=n) and target. Find all possible k integers where their sum is target.Example Given [1,2,3,4], k=2, target=5, [1,4] and [2,3] are possible solutions.
2015-03-04 12:14:50 1980
原创 [LintCode]k Sum
Given n distinct positive integers, integer k (k <= n) and a number target.Find k numbers where sum is target. Calculate how many solutions there are?
2015-03-04 11:40:40 3610
Java做的文本编辑器
2009-07-21
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人