refactor 366

fishercoder1534 · fishercoder1534 · commit 885c63c09533 · 2019-02-04T09:19:26.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_366.java b/src/main/java/com/fishercoder/solutions/_366.java
@@ -5,7 +5,10 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**Given a binary tree, collect a tree's nodes as if you were doing this:
+/**
+ * 366. Find Leaves of Binary Tree
+ *
+ * Given a binary tree, collect a tree's nodes as if you were doing this:
  * Collect and remove all leaves, repeat until the tree is empty.
 
  Example:
@@ -34,23 +37,24 @@
  */
 public class _366 {
 
-    List<List<Integer>> result = new ArrayList<List<Integer>>();
+    public static class Solution1 {
+        List<List<Integer>> result = new ArrayList<>();
 
-    public List<List<Integer>> findLeaves(TreeNode root) {
-        dfs(root);
-        return result;
-    }
-
-    int dfs(TreeNode root) {
-        if (root == null) {
-            return 0;
+        public List<List<Integer>> findLeaves(TreeNode root) {
+            dfs(root);
+            return result;
         }
-        int level = Math.max(dfs(root.left), dfs(root.right)) + 1;
-        if (result.size() < level) {
-            result.add(new ArrayList<Integer>());
+
+        int dfs(TreeNode root) {
+            if (root == null) {
+                return 0;
+            }
+            int level = Math.max(dfs(root.left), dfs(root.right)) + 1;
+            if (result.size() < level) {
+                result.add(new ArrayList<>());
+            }
+            result.get(level - 1).add(root.val);
+            return level;
         }
-        result.get(level - 1).add(root.val);
-        return level;
     }
-
 }
