refactor 222

fishercoder1534 · fishercoder1534 · commit 8c47566c23fb · 2018-09-30T07:43:42.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_222.java b/src/main/java/com/fishercoder/solutions/_222.java
@@ -4,9 +4,7 @@
 
 /**
  * 222. Count Complete Tree Nodes
- *
  * Given a complete binary tree, count the number of nodes.
- *
  * Definition of a complete binary tree from Wikipedia:
  * In a complete binary tree every level,
  * except possibly the last, is completely filled,
@@ -15,8 +13,10 @@
  */
 public class _222 {
 
-    class SolutionRecursive {
-        /**reference: https://discuss.leetcode.com/topic/21317/accepted-easy-understand-java-solution/2*/
+    public static class Solution1 {
+        /**
+         * reference: https://discuss.leetcode.com/topic/21317/accepted-easy-understand-java-solution/2
+         */
         public int countNodes(TreeNode root) {
             int leftH = getLeftHeight(root);
             int rightH = getRightHeight(root);
@@ -46,12 +46,4 @@ private int getLeftHeight(TreeNode root) {
         }
     }
 
-    public static void main(String...args) {
-        System.out.println(1 << 3);
-    }
-
-    class SolutionIterative {
-        /**TODO: implement an iterative solution*/
-    }
-
 }
