码迷,mamicode.com
首页 >  
搜索关键字:combinations    ( 963个结果
leetcode第38题--Combination Sum
题目:Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated ...
分类:其他好文   时间:2014-10-25 22:50:47    阅读次数:267
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 combina...
分类:其他好文   时间:2014-10-25 14:34:02    阅读次数:163
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 numb...
分类:其他好文   时间:2014-10-25 11:56:08    阅读次数:206
LeetCode 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],...
分类:其他好文   时间:2014-10-24 12:44:48    阅读次数:229
Generate Parentheses
[leetcode]Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses....
分类:其他好文   时间:2014-10-21 12:26:59    阅读次数:166
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 number of times....
分类:其他好文   时间:2014-10-21 12:22:27    阅读次数:170
leetcode第21题--Generate Parentheses
problem:Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is...
分类:其他好文   时间:2014-10-20 00:37:44    阅读次数:256
Euler Project question 29 in python way
# This python file uses the following encoding: utf-8# Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:# 22=4, 23=8, 24=16, 25=32#...
分类:编程语言   时间:2014-10-19 21:23:27    阅读次数:152
leetcode第18题--Letter Combinations of a Phone Number
Problem:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the ...
分类:其他好文   时间:2014-10-18 23:48:28    阅读次数:156
【LeetCode】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: "((()))", "(()())", "(())()", "()(())", "()...
分类:其他好文   时间:2014-10-16 17:12:42    阅读次数:186
963条   上一页 1 ... 78 79 80 81 82 ... 97 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!