refactor 298

fishercoder1534 · fishercoder1534 · commit 4b769d7698ca · 2018-12-05T07:43:13.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_298.java b/src/main/java/com/fishercoder/solutions/_298.java
@@ -29,28 +29,29 @@ The longest consecutive path need to be from parent to child (cannot be the reve
  */
 public class _298 {
 
-    private int max = 1;
-
-    public int longestConsecutive(TreeNode root) {
-        if (root == null) {
-            return 0;
+    public static class Solution1 {
+        private int max = 1;
+
+        public int longestConsecutive(TreeNode root) {
+            if (root == null) {
+                return 0;
+            }
+            dfs(root, 0, root.val);
+            return max;
         }
-        dfs(root, 0, root.val);
-        return max;
-    }
 
-    private void dfs(TreeNode root, int curr, int target) {
-        if (root == null) {
-            return;
+        private void dfs(TreeNode root, int curr, int target) {
+            if (root == null) {
+                return;
+            }
+            if (root.val == target) {
+                curr++;
+            } else {
+                curr = 1;
+            }
+            max = Math.max(max, curr);
+            dfs(root.left, curr, root.val + 1);
+            dfs(root.right, curr, root.val + 1);
         }
-        if (root.val == target) {
-            curr++;
-        } else {
-            curr = 1;
-        }
-        max = Math.max(max, curr);
-        dfs(root.left, curr, root.val + 1);
-        dfs(root.right, curr, root.val + 1);
     }
-
 }
