题目:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telep...
分类:
其他好文 时间:
2015-05-22 14:55:29
阅读次数:
135
题目:Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,...
分类:
其他好文 时间:
2015-05-21 22:19:59
阅读次数:
118
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given "25525511135",return ["25...
分类:
编程语言 时间:
2015-05-20 23:46:09
阅读次数:
157
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:
"((()))", "(()())", "(())()", "()(())", "()()...
分类:
其他好文 时间:
2015-05-20 16:22:27
阅读次数:
92
这道题要求手机上,不同的数字所对应的字母的组合,就是一步步往上求就可以了,可能有点类似于动态规划的先求解子问题,再求出总的#include#include#include #includeusing namespace std;static string str[10]={"0","1","abc"...
分类:
其他好文 时间:
2015-05-19 20:51:44
阅读次数:
167
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,.....
分类:
编程语言 时间:
2015-05-18 22:47:14
阅读次数:
150
LetterCombinationsofaPhoneNumberTotalAccepted:39162TotalSubmissions:151116MySubmissionsQuestionSolutionGivenadigitstring,returnallpossiblelettercombinationsthatthenumbercouldrepresent.Amappingofdigittoletters(justlikeonthetelephonebuttons)isgivenbelow.Input..
分类:
其他好文 时间:
2015-05-18 20:55:38
阅读次数:
115
1 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...
分类:
编程语言 时间:
2015-05-16 12:00:54
阅读次数:
139
题目Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:
Given “25525511135”,return [“255.255.11.135”, “255.255.111.35”]. (Order does no...
分类:
其他好文 时间:
2015-05-16 00:14:24
阅读次数:
145
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 repeate...
分类:
其他好文 时间:
2015-05-15 13:20:00
阅读次数:
99