2016年5月24日
LeetCode OJ 40. Combination Sum II
摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文
posted @ 2016-05-24 23:19 Black_Knight 阅读(207) 评论(0) 推荐(0) 编辑
LeetCode OJ 39. Combination Sum
摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeat 阅读全文
posted @ 2016-05-24 15:40 Black_Knight 阅读(432) 评论(0) 推荐(0) 编辑