![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
combination
mars2014jia
这个作者很懒,什么都没留下…
展开
-
Permutations II
public class Solution { public ArrayList> permuteUnique(int[] num) { // use hashset to keep uniqueness, 其他和I一样 ArrayList> res = new ArrayList>(); if(num==null || num.length原创 2015-03-19 11:18:48 · 158 阅读 · 0 评论 -
Permutations
public ArrayList> permute(int[] num) { ArrayList> res = new ArrayList>(); if(num==null || num.length==0) return res;ArrayList t = new ArrayList(); t.add(num[0]); res.a原创 2015-03-19 09:13:21 · 204 阅读 · 0 评论 -
Permutation Sequence
public String getPermutation(int n, int k) { // 比较难理解: http://blog.csdn.net/linhuanmars/article/details/22028697, http://www.cnblogs.com/springfor/p/3896201.html if(n==0 ) return null;转载 2015-03-19 05:17:27 · 200 阅读 · 0 评论 -
Letter Combinations of a Phone Number
public class Solution { String[] keybd ={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"}; // http://www.cnblogs.com/springfor/p/3879829.html public ArrayList letterCombinations转载 2015-03-11 03:13:12 · 171 阅读 · 0 评论 -
Generate Parentheses
相关知识 http://blog.csdn.net/wuzhekai1985/article/details/6764858public class Solution { public ArrayList generateParenthesis(int n) { //ref http://blog.csdn.net/linhuanmars/article/de转载 2015-03-11 01:28:35 · 268 阅读 · 0 评论 -
Restore IP Addresses
// 解题 ref http://bangbingsyb.blogspot.com/2014/11/leetcode-restore-ip-addresses.html引用原文一个有效的IP地址由4个数字组成,每个数字在0-255之间。对于其中的2位数或3位数,不能以0开头。所以对于以s[i]开头的数字有3种可能:1. s[i]2. s[i : i+1转载 2015-03-13 05:25:09 · 195 阅读 · 0 评论