refactor 1145

fishercoder1534 · fishercoder1534 · commit cbd68615e924 · 2021-03-05T07:49:51.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1145.java b/src/main/java/com/fishercoder/solutions/_1145.java
@@ -1,6 +1,7 @@
 package com.fishercoder.solutions;
 
 import com.fishercoder.common.classes.TreeNode;
+
 public class _1145 {
     public static class Solution1 {
         public boolean btreeGameWinningMove(TreeNode root, int n, int x) {
diff --git a/src/test/java/com/fishercoder/_1145Test.java b/src/test/java/com/fishercoder/_1145Test.java
@@ -14,7 +14,7 @@
 public class _1145Test {
 
     private static _1145.Solution1 solution1;
-    private static TreeNode root1;
+    private static TreeNode root;
     private static int n;
     private static int x;
 
@@ -25,9 +25,9 @@ public static void setup() {
 
     @Test
     public void test1() {
-        root1 = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11));
+        root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11));
         n = 11;
         x = 3;
-        Assert.assertEquals(true, solution1.btreeGameWinningMove(root1, n, x));
+        Assert.assertEquals(true, solution1.btreeGameWinningMove(root, n, x));
     }
 }
