dfs
文章平均质量分 72
mars2014jia
这个作者很懒,什么都没留下…
展开
-
Clone Graph
Clone Graph lone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquel转载 2015-03-07 05:58:10 · 196 阅读 · 0 评论 -
9.9 N queen I and II leetcode 原题
参考来源//http://blog.csdn.net/u011095253/article/details/9158473 public class Solution { //http://blog.csdn.net/u011095253/article/details/9158473 public ArrayList solveNQueens(int n) {转载 2015-02-11 00:17:39 · 230 阅读 · 0 评论 -
Word Search
1) dfs 2) 维护visited 数组,dp类似 3) 关于最后吧visited这一位清回false的解释 ref http://www.cnblogs.com/springfor/p/3883942.html public class Solution { public boolean exist(char[][] board, String word) {转载 2015-03-17 12:42:10 · 385 阅读 · 0 评论 -
Recover Binary Search Tree
重点 1 inorder 2 怎么用O(1)的space, 必然是用tmp的指针做swap ref http://www.cnblogs.com/springfor/p/3891390.html public class Solution { TreeNode first, pre, second; public void recoverTree(TreeNode root转载 2015-03-21 05:26:26 · 200 阅读 · 0 评论 -
Palindrome Partitioning
package leetCode; import java.util.ArrayList; public class Palindrome { public static ArrayList> partition(String s) { // 根据打印出来的结果不能使用如下dp方法 ref http://www.programcreek.co转载 2015-03-10 11:52:19 · 190 阅读 · 0 评论 -
Generate Parentheses
相关知识 http://blog.csdn.net/wuzhekai1985/article/details/6764858 public class Solution { public ArrayList generateParenthesis(int n) { //ref http://blog.csdn.net/linhuanmars/article/de转载 2015-03-11 01:28:35 · 273 阅读 · 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 · 177 阅读 · 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 · 199 阅读 · 0 评论 -
Count and Say
public class Solution { //dfs 算法还待写吧 http://www.cnblogs.com/huntfor/p/3849547.html public String countAndSay(int n) { if(n<=0) return null; String s = "1"; in转载 2015-03-13 10:14:53 · 202 阅读 · 0 评论