Backtracking
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Leetcode#17||Letter Combinations of a Phone Number
public class Solution { public List letterCombinations(String digits) { List result = new ArrayList(); if (digits == null || digits.length() == 0) { return res原创 2015-08-12 11:31:46 · 286 阅读 · 0 评论 -
Leetcode#22||Generate Parentheses
public class Solution { public List generateParenthesis(int n) { List result = new ArrayList(); if (n <= 0) { return result; } dfs(res原创 2015-08-12 15:59:42 · 271 阅读 · 0 评论 -
Leetcode#60||Permutation Sequence
public class Solution { public String getPermutation(int n, int k) { StringBuilder result = new StringBuilder(); List list = new ArrayList(); int factorial = 1;原创 2015-08-18 10:59:01 · 326 阅读 · 0 评论