refactor 513

fishercoder1534 · fishercoder1534 · commit de2bc3bae1de · 2019-06-01T07:26:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_513.java b/src/main/java/com/fishercoder/solutions/_513.java
@@ -6,6 +6,8 @@
 import java.util.Queue;
 
 /**
+ * 513. Find Bottom Left Tree Value
+ *
  * Given a binary tree, find the leftmost value in the last row of the tree.
 
  Example 1:
@@ -35,25 +37,27 @@
  */
 public class _513 {
 
-    public int findBottomLeftValue(TreeNode root) {
-        Queue<TreeNode> queue = new LinkedList<>();
-        queue.offer(root);
-        TreeNode leftMost = root;
-        while (!queue.isEmpty()) {
-            int size = queue.size();
-            for (int i = 0; i < size; i++) {
-                TreeNode curr = queue.poll();
-                if (i == 0) {
-                    leftMost = curr;
-                }
-                if (curr.left != null) {
-                    queue.offer(curr.left);
-                }
-                if (curr.right != null) {
-                    queue.offer(curr.right);
+    public static class Solution1 {
+        public int findBottomLeftValue(TreeNode root) {
+            Queue<TreeNode> queue = new LinkedList<>();
+            queue.offer(root);
+            TreeNode leftMost = root;
+            while (!queue.isEmpty()) {
+                int size = queue.size();
+                for (int i = 0; i < size; i++) {
+                    TreeNode curr = queue.poll();
+                    if (i == 0) {
+                        leftMost = curr;
+                    }
+                    if (curr.left != null) {
+                        queue.offer(curr.left);
+                    }
+                    if (curr.right != null) {
+                        queue.offer(curr.right);
+                    }
                 }
             }
+            return leftMost.val;
         }
-        return leftMost.val;
     }
 }
diff --git a/src/test/java/com/fishercoder/_513Test.java b/src/test/java/com/fishercoder/_513Test.java
@@ -12,14 +12,14 @@
  * Created by fishercoder on 1/15/17.
  */
 public class _513Test {
-    private static _513 test;
+    private static _513.Solution1 solution1;
     private static int expected;
     private static int actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup() {
-        test = new _513();
+        solution1 = new _513.Solution1();
     }
 
     @Before
@@ -35,7 +35,7 @@ public void test1() {
         root.left = new TreeNode(1);
         root.right = new TreeNode(3);
         expected = 1;
-        actual = test.findBottomLeftValue(root);
+        actual = solution1.findBottomLeftValue(root);
         assertEquals(expected, actual);
 
     }
@@ -50,7 +50,7 @@ public void test2() {
         root.right.right = new TreeNode(6);
         root.right.left.left = new TreeNode(7);
         expected = 7;
-        actual = test.findBottomLeftValue(root);
+        actual = solution1.findBottomLeftValue(root);
         assertEquals(expected, actual);
     }
 }
