refactor 235

fishercoder1534 · fishercoder1534 · commit a08a9fd696ae · 2018-10-10T07:21:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_235.java b/src/main/java/com/fishercoder/solutions/_235.java
@@ -24,16 +24,18 @@ For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6.
  */
 public class _235 {
 
-    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
-        if (root == null || p == root || q == root) {
-            return root;
-        }
-        if ((root.val - p.val) * (root.val - q.val) > 0) {
-            if (root.val - p.val > 0) {
-                return lowestCommonAncestor(root.left, p, q);
+    public static class Solution1 {
+        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+            if (root == null || p == root || q == root) {
+                return root;
             }
-            return lowestCommonAncestor(root.right, p, q);
+            if ((root.val - p.val) * (root.val - q.val) > 0) {
+                if (root.val - p.val > 0) {
+                    return lowestCommonAncestor(root.left, p, q);
+                }
+                return lowestCommonAncestor(root.right, p, q);
+            }
+            return root;
         }
-        return root;
     }
 }
