09 2016 档案

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-09-09 17:12 hhboboy 阅读(232) 评论(0) 推荐(0) 编辑