refactor 563

fishercoder1534 · fishercoder1534 · commit adb7ca7855e2 · 2019-07-05T08:09:31.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_563.java b/src/main/java/com/fishercoder/solutions/_563.java
@@ -1,18 +1,15 @@
 package com.fishercoder.solutions;
 
-/**
- * Created by fishercoder on 4/23/17.
- */
-
 import com.fishercoder.common.classes.TreeNode;
 
-/**Binary Tree Tilt
+/**
+ * 563. Binary Tree Tilt
  *
  * Given a binary tree, return the tilt of the whole tree.
-
- The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values.
- Null node has tilt 0.
- The tilt of the whole tree is defined as the sum of all nodes' tilt.
+ * The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values
+ * and the sum of all right subtree node values.
+ * Null node has tilt 0.
+ * The tilt of the whole tree is defined as the sum of all nodes' tilt.
 
  Example:
  Input:
@@ -32,31 +29,33 @@
  The sum of node values in any subtree won't exceed the range of 32-bit integer.
  All the tilt values won't exceed the range of 32-bit integer.*/
 public class _563 {
+    public static class Solution1 {
 
-    int tilt = 0;
+        int tilt = 0;
 
-    public int findTilt(TreeNode root) {
-        findTiltDfs(root);
-        return tilt;
-    }
-
-    public int findTiltDfs(TreeNode root) {
-        if (root == null) {
-            return 0;
-        }
-        int leftTilt = 0;
-        if (root.left != null) {
-            leftTilt = findTiltDfs(root.left);
+        public int findTilt(TreeNode root) {
+            findTiltDfs(root);
+            return tilt;
         }
-        int rightTilt = 0;
-        if (root.right != null) {
-            rightTilt = findTiltDfs(root.right);
-        }
-        if (root.left == null && root.right == null) {
-            return root.val;
+
+        public int findTiltDfs(TreeNode root) {
+            if (root == null) {
+                return 0;
+            }
+            int leftTilt = 0;
+            if (root.left != null) {
+                leftTilt = findTiltDfs(root.left);
+            }
+            int rightTilt = 0;
+            if (root.right != null) {
+                rightTilt = findTiltDfs(root.right);
+            }
+            if (root.left == null && root.right == null) {
+                return root.val;
+            }
+            tilt += Math.abs(leftTilt - rightTilt);
+            return leftTilt + rightTilt + root.val;
         }
-        tilt += Math.abs(leftTilt - rightTilt);
-        return leftTilt + rightTilt + root.val;
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_563Test.java b/src/test/java/com/fishercoder/_563Test.java
@@ -12,14 +12,14 @@
  * Created by fishercoder on 4/23/17.
  */
 public class _563Test {
-    private static _563 test;
+    private static _563.Solution1 solution1;
     private static int expected;
     private static int actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup() {
-        test = new _563();
+        solution1 = new _563.Solution1();
         actual = 0;
     }
 
@@ -29,7 +29,7 @@ public void test1() {
         root.left = new TreeNode(2);
         root.right = new TreeNode(3);
         expected = 1;
-        actual = test.findTilt(root);
+        actual = solution1.findTilt(root);
         assertEquals(expected, actual);
     }
 
@@ -42,7 +42,7 @@ public void test2() {
         root.left.left = new TreeNode(4);
         root.right.left = new TreeNode(5);
         expected = 11;
-        actual = test.findTilt(root);
+        actual = solution1.findTilt(root);
         assertEquals(expected, actual);
     }
 
