码迷,mamicode.com
首页 >  
搜索关键字:combinations    ( 963个结果
LeetCode 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.255.11.135", "255.255.111.35"]. (Order ...
分类:其他好文   时间:2015-04-21 16:06:05    阅读次数:99
[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-04-21 14:33:22    阅读次数:114
LeetCode93——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.255.11.135", "255.255.111.35"]. (Order does ...
分类:其他好文   时间:2015-04-20 14:53:39    阅读次数:95
39. 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 ...
分类:其他好文   时间:2015-04-17 23:48:42    阅读次数:140
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 telep...
分类:其他好文   时间:2015-04-17 01:03:11    阅读次数:128
Combinations
/*题意:给两个数n,和k,求1-n的组合情况解法:递归求解*/class Solution {public: vector >res; int count; void Comb(int A[],int n,int k,int step){ if(step == k)...
分类:其他好文   时间:2015-04-16 19:33:28    阅读次数:108
leetcode || 93、 Restore IP Addresses
problem: 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...
分类:其他好文   时间:2015-04-15 17:03:24    阅读次数:91
[*leetcode 39] 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 num...
分类:其他好文   时间:2015-04-15 12:54:51    阅读次数:120
[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-04-15 11:25:44    阅读次数:113
leetcode Letter Combinations of a Phone Number
代码: 1 #include 2 #include 3 #include 4 5 using namespace std; 6 7 vector cs = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"}; 8 vector *r.....
分类:其他好文   时间:2015-04-15 00:58:16    阅读次数:106
963条   上一页 1 ... 57 58 59 60 61 ... 97 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!