2014年12月28日
[LeetCode] 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... 阅读全文
posted @ 2014-12-28 20:08 Acjx 阅读(357) 评论(0) 推荐(0)
[LeetCode] Letter Combinations of a Phone Number
摘要： Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string "2... 阅读全文
posted @ 2014-12-28 15:07 Acjx 阅读(399) 评论(0) 推荐(0)
[LeetCode] 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 repeated number may be chosen from C unlimited number o... 阅读全文
posted @ 2014-12-28 12:30 Acjx 阅读(427) 评论(0) 推荐(0)