refactor 236

fishercoder1534 · fishercoder1534 · commit 104c54a155aa · 2018-10-11T06:33:34.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_236.java b/src/main/java/com/fishercoder/solutions/_236.java
@@ -22,23 +22,27 @@ For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3.
  Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.*/
 
 public class _236 {
-
-    /**We need to find TWO nodes in the tree,
-     * so we'll have to divide and conquer this tree,
-     * we need to have two nodes to as the intermediate result,
-     * also, refer to my earlier drawings:http://www.fishercoder.com/2016/06/23/lowest-common-ancestor-of-a-binary-tree/
-     * I'm really impressed with myself at that time!*/
-
-    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        if (root == null || root == p || root == q) {
-            return root;
-        }
-        TreeNode left = lowestCommonAncestor(root.left, p, q);
-        TreeNode right = lowestCommonAncestor(root.right, p, q);
-        if (left != null && right != null) {
-            return root;
+    public static class Solution1 {
+
+        /**
+         * We need to find TWO nodes in the tree,
+         * so we'll have to divide and conquer this tree,
+         * we need to have two nodes to as the intermediate result,
+         * also, refer to my earlier drawings:http://www.fishercoder.com/2016/06/23/lowest-common-ancestor-of-a-binary-tree/
+         * I'm really impressed with myself at that time!
+         */
+
+        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+            if (root == null || root == p || root == q) {
+                return root;
+            }
+            TreeNode left = lowestCommonAncestor(root.left, p, q);
+            TreeNode right = lowestCommonAncestor(root.right, p, q);
+            if (left != null && right != null) {
+                return root;
+            }
+            return left != null ? left : right;
         }
-        return left != null ? left : right;
     }
 
 }
