码迷,mamicode.com
首页 >  
搜索关键字:combinations    ( 963个结果
(回溯法)解决一系列组合问题
题目一: 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] ...
分类:其他好文   时间:2017-02-03 15:40:17    阅读次数:205
【LeetCode】22. Generate Parentheses (I thought I know Python...)
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-01-15 20:32:27    阅读次数:232
Leetcode 254. Factor Combinations
Numbers can be regarded as product of its factors. For example, Write a function that takes an integer n and return all possible combinations of its f ...
分类:其他好文   时间:2017-01-05 13:26:23    阅读次数:162
Leetcode 377. Combination Sum IV
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-01-05 07:54:13    阅读次数:151
Leetcode 216. Combination Sum III
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-01-05 07:52:24    阅读次数:117
Leetcode 39. Combination Sum
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-01-05 07:52:07    阅读次数:161
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: 分析: 组合的实现,之前实 ...
分类:其他好文   时间:2017-01-05 00:58:49    阅读次数:145
22. 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:[ "... ...
分类:其他好文   时间:2017-01-04 23:30:35    阅读次数:280
【LeetCode】17. 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 telepho ...
分类:其他好文   时间:2016-12-23 01:06:35    阅读次数:133
22. Generate Parentheses——本质:树,DFS求解可能的path
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: c ...
分类:其他好文   时间:2016-12-21 23:34:48    阅读次数:211
963条   上一页 1 ... 24 25 26 27 28 ... 97 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!