fd

liwentian · liwentian · commit 99e625fb1de1 · 2017-10-21T11:10:38.000+08:00
diff --git a/ebook/tree/Tree.tex b/ebook/tree/Tree.tex
@@ -409,66 +409,6 @@ \subsubsection{Solution II}
 
 \newpage
 
-\section{Populating Next Right Pointers in Each Node II} %%%%%%%%%%%%%%%%%%%%%%  
-
-\subsubsection{Description}
-Follow up for problem "Populating Next Right Pointers in Each Node".
-
-What if the given tree could be any binary tree? Would your previous solution still work?
-
-\textbf{Note:}
-
-You may only use constant extra space.
-
-\subsubsection{Solution I}
-
-\begin{Code}
-/**
- * 和上题的区别在于这里root下一个循环要指向dummy.next，即下一层链表表头
- */
-public void connect(TreeLinkNode root) {
-    while (root != null) {
-        TreeLinkNode dummy = new TreeLinkNode(0), cur = dummy;
-        for (TreeLinkNode node = root; node != null; node = node.next) {
-            if (node.left != null) {
-                cur.next = node.left;
-                cur = cur.next;
-            }
-
-            if (node.right != null) {
-                cur.next = node.right;
-                cur = cur.next;
-            }
-        }
-        root = dummy.next;
-    }
-}
-\end{Code}
-
-\subsubsection{Solution II}
-\begin{Code}
-/** 递归，和上题相比改都不用改
-public void connect(TreeLinkNode root) {
-    if (root == null) {
-        return;
-    }
-    TreeLinkNode dummy = new TreeLinkNode(0), cur = dummy;
-    for (TreeLinkNode p = root; p != null; p = p.next) {
-        if (p.left != null) {
-            cur.next = p.left;
-            cur = cur.next;
-        }
-        if (p.right != null) {
-            cur.next = p.right;
-            cur = cur.next;
-        }
-    }
-    connect(dummy.next);
-}*/
-\end{Code}
-
-\newpage
-
 \section{Convert Sorted Array to Binary Search Tree} %%%%%%%%%%%%%%%%%%%%%%
 
 \subsubsection{Description}
@@ -642,7 +582,7 @@ \subsubsection{Solution II}
     }
 
     for (TreeNode node = q; node != null; node = parents.get(node)) {
-        if (!set.contains(node)) {
+        if (set.contains(node)) {
             return node;
         }
     }
diff --git a/solution/src/main/java/com/inuker/solution/LowestCommonAncestorOfBinaryTree.java b/solution/src/main/java/com/inuker/solution/LowestCommonAncestorOfBinaryTree.java
@@ -80,7 +80,7 @@ public TreeNode lowestCommonAncestor2(TreeNode root, TreeNode p, TreeNode q) {
         }
 
         for (TreeNode node = q; node != null; node = parents.get(node)) {
-            if (!set.contains(node)) {
+            if (set.contains(node)) {
                 return node;
             }
         }

Original file line number	Diff line number	Diff line change
`@@ -80,7 +80,7 @@ public TreeNode lowestCommonAncestor2(TreeNode root, TreeNode p, TreeNode q) {`
`80`	`80`	`}`
`81`	`81`
`82`	`82`	`for (TreeNode node = q; node != null; node = parents.get(node)) {`
`83`		`- if (!set.contains(node)) {`
	`83`	`+ if (set.contains(node)) {`
`84`	`84`	`return node;`
`85`	`85`	`}`
`86`	`86`	`}`