2017年2月8日
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 number in C may only be used once in the combination.N... 阅读全文
posted @ 2017-02-08 23:29 copperface 阅读(174) 评论(0) 推荐(0) 编辑
39. Combination Sum
摘要： Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C... 阅读全文
posted @ 2017-02-08 10:53 copperface 阅读(658) 评论(0) 推荐(0) 编辑
38. Count and Say
摘要： The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2, then o... 阅读全文
posted @ 2017-02-08 09:36 copperface 阅读(181) 评论(0) 推荐(0) 编辑