refactor 104

fishercoder1534 · fishercoder1534 · commit 07919418e75d · 2018-03-17T08:22:51.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_104.java b/src/main/java/com/fishercoder/solutions/_104.java
@@ -4,16 +4,19 @@
 
 /**
  * 104. Maximum Depth of Binary Tree
+ *
  * Given a binary tree, find its maximum depth.
  * The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
  */
 public class _104 {
 
+  public static class Solution1 {
     public int maxDepth(TreeNode root) {
-        if (root == null) {
-            return 0;
-        }
-        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
+      if (root == null) {
+        return 0;
+      }
+      return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
     }
+  }
 
 }
diff --git a/src/test/java/com/fishercoder/_104Test.java b/src/test/java/com/fishercoder/_104Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._104;
+import java.util.Arrays;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _104Test {
+  private static _104.Solution1 solution1;
+  private static TreeNode root;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _104.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    root = TreeUtils.constructBinaryTree(Arrays.asList(3, 9, 20, null, null, 15, 7));
+    assertEquals(3, solution1.maxDepth(root));
+  }
+}
