refactor 437

fishercoder1534 · fishercoder1534 · commit 51ce8af53e0b · 2019-03-31T07:05:17.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_437.java b/src/main/java/com/fishercoder/solutions/_437.java
@@ -3,6 +3,8 @@
 import com.fishercoder.common.classes.TreeNode;
 
 /**
+ * 437. Path Sum III
+ *
  * You are given a binary tree in which each node contains an integer value.
 
  Find the number of paths that sum to a given value.
@@ -32,18 +34,20 @@ The path does not need to start or end at the root or a leaf, but it must go dow
 
 public class _437 {
 
-    public int pathSum(TreeNode root, int sum) {
-        if (root == null) {
-            return 0;
+    public static class Solution1 {
+        public int pathSum(TreeNode root, int sum) {
+            if (root == null) {
+                return 0;
+            }
+            return pathSumFrom(root, sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
         }
-        return pathSumFrom(root, sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
-    }
 
-    private int pathSumFrom(TreeNode root, int sum) {
-        if (root == null) {
-            return 0;
+        private int pathSumFrom(TreeNode root, int sum) {
+            if (root == null) {
+                return 0;
+            }
+            return (root.val == sum ? 1 : 0) + pathSumFrom(root.left, sum - root.val) + pathSumFrom(root.right, sum - root.val);
         }
-        return (root.val == sum ? 1 : 0) + pathSumFrom(root.left, sum - root.val) + pathSumFrom(root.right, sum - root.val);
     }
 
 }
