码迷,mamicode.com
首页 >  
搜索关键字:combinations    ( 963个结果
Combination Sum -- leetcode
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 numb...
分类:其他好文   时间:2015-01-15 18:17:48    阅读次数:186
[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 telephon...
分类:其他好文   时间:2015-01-15 18:08:11    阅读次数:108
leetcode-combination sum and combination sum II
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....
分类:其他好文   时间:2015-01-13 14:08:00    阅读次数:100
[leetcode] Letter Combinations of a Phone Number
Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit ...
分类:其他好文   时间:2015-01-13 14:03:28    阅读次数:226
LeetCode--Combinations
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], [2,3], [1,2], [1,3], [1,4], ]...
分类:其他好文   时间:2015-01-13 08:58:28    阅读次数:117
Leetcode Generate Parentheses
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))...
分类:其他好文   时间:2015-01-11 21:31:35    阅读次数:245
Generate Parentheses(组合,回溯)
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))...
分类:其他好文   时间:2015-01-11 16:08:58    阅读次数:197
[C++]LeetCode: 87 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:D...
分类:编程语言   时间:2015-01-11 14:56:20    阅读次数:236
Combinations
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,3],...
分类:其他好文   时间:2015-01-11 00:54:09    阅读次数:242
[C++]LeetCode: 84 Generate Parentheses (卡特兰数)
题目: 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-01-10 16:42:46    阅读次数:261
963条   上一页 1 ... 69 70 71 72 73 ... 97 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!