码迷,mamicode.com
首页 >  
搜索关键字:combinations    ( 963个结果
[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 numb...
分类:其他好文   时间:2014-08-24 23:29:33    阅读次数:176
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.....
分类:其他好文   时间:2014-08-23 21:37:41    阅读次数:199
[LeetCode] Letter Combinations of a Phone Number(bfs)
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...
分类:其他好文   时间:2014-08-23 18:53:01    阅读次数:180
compute Binomial Coefficient or combinations with dynamic programming
The ProblemWrite a function that takes two parameters n and k and returns the value of Binomial Coefficient C(n, k).For example, your function should ...
分类:其他好文   时间:2014-08-23 12:41:20    阅读次数:169
Restore IP Addresses
Restore IP Addresses  Total Accepted: 12696 Total Submissions: 61955My Submissions Given a string containing only digits, restore it by returning all possible valid IP address combinations...
分类:其他好文   时间:2014-08-22 21:15:49    阅读次数:277
leetcode之Combination Sum
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 ...
分类:其他好文   时间:2014-08-22 16:24:19    阅读次数:202
【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...
分类:其他好文   时间:2014-08-21 19:30:24    阅读次数:225
Cracking the Coding Interview 8.5
Implement an algorithm to print all valid combinations of n-pairs of parentheses#includevoid f(int idx,int left,int right,char *buf){ if(left == 0 ...
分类:其他好文   时间:2014-08-21 13:06:34    阅读次数:168
projecteuler---->problem=29----Distinct powers
Problem 29 Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: 22=4, 23=8, 24=16, 25=32 32=9, 33=27, 34=81, 35=243 42=16, 43=64, 44=256, 45=1024 52=25, 53=125, 54=625, 55=312...
分类:其他好文   时间:2014-08-21 08:26:53    阅读次数:177
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255...
分类:其他好文   时间:2014-08-19 20:40:45    阅读次数:203
963条   上一页 1 ... 83 84 85 86 87 ... 97 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!