istudygithub
diff --git a/‎ebook/tree/Tree.tex‎
Lines changed: 4 additions & 33 deletions b/‎ebook/tree/Tree.tex‎
Lines changed: 4 additions & 33 deletions
diff --git a/‎ebook/tree/leetcode-tree.log‎
Lines changed: 1 addition & 1 deletion b/‎ebook/tree/leetcode-tree.log‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎ebook/tree/leetcode-tree.pdf‎
-81 Bytes b/‎ebook/tree/leetcode-tree.pdf‎
-81 Bytes
diff --git a/‎ebook/tree/leetcode-tree.synctex.gz‎
-586 Bytes b/‎ebook/tree/leetcode-tree.synctex.gz‎
-586 Bytes
diff --git a/‎solution/src/main/java/com/inuker/solution/HouseRobberIII.java‎
Lines changed: 3 additions & 0 deletions b/‎solution/src/main/java/com/inuker/solution/HouseRobberIII.java‎
Lines changed: 3 additions & 0 deletions
@@ -1292,9 +1292,9 @@ \subsubsection{Solution I}
 
 \begin{Code}
 /**
- * 当root.val == Sum时，不要return，因为继续往下走可能有路径刚好加起来为0，典型的为[1,-2,1,-1]，目标和为-1
- * 这里隐藏了四条路径，[1,-2], [-2,1], [-1], [1,-2,1,-1]，如果在[1,-2]就return了，那就会掉了[1,-2,1,-1]
- * 可参考https://discuss.leetcode.com/category/562/path-sum-iii
+ * 当root.val == Sum时，不要return，因为继续往下走可能有路径刚好加起来为0，典型的为[1,-2,1,-1]，
+ * 目标和为-1, 这里隐藏了四条路径，[1,-2], [-2,1], [-1], [1,-2,1,-1]，如果在[1,-2]就return了，
+ * 那就会掉了[1,-2,1,-1]
  */
 
 /**
@@ -1857,6 +1857,7 @@ \subsubsection{Solution}
     return rob(root, true);
 }
 
+// rob true表示不定，false表示不选root
 private int rob(TreeNode root, boolean rob) {
     if (root == null) {
         return 0;
@@ -2004,18 +2005,6 @@ \subsubsection{Description}
 \subsubsection{Solution}
 
 \begin{Code}
-/**
- * 错误的写法，和第104题非常类似
-public int minDepth(TreeNode root) {
-    if (root == null) {
-        return 0;
-    }
-    if (root.left == null && root.right == null) {
-        return 1;
-    }
-    return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
-}*/
-
 public int minDepth(TreeNode root) {
     if (root == null) {
         return 0;
@@ -2029,24 +2018,6 @@ \subsubsection{Solution}
         return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
     }
 }
-
-/**
-public int minDepth(TreeNode root) {
-    if (root == null) {
-        return 0;
-    }
-    return helper(root);
-}
-
-private int helper(TreeNode root) {
-    if (root == null) {
-        return Integer.MAX_VALUE;
-    }
-    if (root.left == null && root.right == null) {
-        return 1;
-    }
-    return Math.min(helper(root.left), helper(root.right)) + 1;
-}*/
 \end{Code}
 
 \newpage
 
@@ -1,4 +1,4 @@
-This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  22 SEP 2017 10:48
+This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  23 SEP 2017 18:04
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
 
@@ -12,6 +12,9 @@ public int rob(TreeNode root) {
         return rob(root, true);
     }
 
+    /**
+     * @param rob true表示不定，false表示不选root
+     */
     private int rob(TreeNode root, boolean rob) {
         if (root == null) {
             return 0;
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4) 22 SEP 2017 10:48`
	`1`	`+This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4) 23 SEP 2017 18:04`
`2`	`2`	`entering extended mode`
`3`	`3`	`restricted \write18 enabled.`
`4`	`4`	`%&-line parsing enabled.`
Original file line number	Diff line number	Diff line change
`@@ -12,6 +12,9 @@ public int rob(TreeNode root) {`
`12`	`12`	`return rob(root, true);`
`13`	`13`	`}`
`14`	`14`
	`15`	`+ /**`
	`16`	`+ * @param rob true表示不定，false表示不选root`
	`17`	`+ */`
`15`	`18`	`private int rob(TreeNode root, boolean rob) {`
`16`	`19`	`if (root == null) {`
`17`	`20`	`return 0;`