Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be ...
分类：
编程语言 时间：
2017-03-30 16:57:22
阅读次数：
125
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 ...
分类：
其他好文 时间：
2017-03-17 12:04:52
阅读次数：
125
My java solution with FIFO queue https://discuss.leetcode.com/topic/8465/my-java-solution-with-fifo-queue public List<String> letterCombinations(Strin ...
分类：
其他好文 时间：
2017-03-05 18:02:21
阅读次数：
219
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. ...
分类：
其他好文 时间：
2017-02-25 17:04:20
阅读次数：
146
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: ...
分类：
其他好文 时间：
2017-02-15 10:52:45
阅读次数：
156
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: [ [2,4], [3,4 ...
分类：
其他好文 时间：
2017-02-12 10:52:42
阅读次数：
179
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho ...
分类：
其他好文 时间：
2017-02-11 15:51:24
阅读次数：
176
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 ...
分类：
其他好文 时间：
2017-02-11 11:18:38
阅读次数：
155
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 numb... ...
分类：
其他好文 时间：
2017-02-09 00:54:27
阅读次数：
275
class Solution { public: vector<string> letterCombinations(string digits) { vector<string> res; if (digits.empty()) return res; string dict[] = {"abc" ...
分类：
其他好文 时间：
2017-02-08 23:13:50
阅读次数：
182
