fix tests for 298

fishercoder1534 · fishercoder1534 · commit 3bb6e8afebd5 · 2021-07-29T10:12:40.000-07:00
diff --git a/src/test/java/com/fishercoder/_298Test.java b/src/test/java/com/fishercoder/_298Test.java
@@ -3,7 +3,6 @@
 import com.fishercoder.common.classes.TreeNode;
 import com.fishercoder.common.utils.TreeUtils;
 import com.fishercoder.solutions._298;
-import org.junit.BeforeClass;
 import org.junit.Test;
 
 import java.util.Arrays;
@@ -14,28 +13,29 @@ public class _298Test {
     private static _298.Solution1 solution1;
     private static _298.Solution2 solution2;
 
-    @BeforeClass
-    public static void setup() {
-        solution1 = new _298.Solution1();
-        solution2 = new _298.Solution2();
-    }
-
     @Test
     public void test1() {
+        solution1 = new _298.Solution1();
+        solution2 = new _298.Solution2();
         TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, null, 3, 2, 4, null, null, null, 5));
         assertEquals(3, solution1.longestConsecutive(root));
         assertEquals(3, solution2.longestConsecutive(root));
     }
 
     @Test
     public void test2() {
+        solution1 = new _298.Solution1();
+        solution2 = new _298.Solution2();
         TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(2, null, 3, 2, null, 1));
+        TreeUtils.printBinaryTree(root);
         assertEquals(2, solution1.longestConsecutive(root));
         assertEquals(2, solution2.longestConsecutive(root));
     }
 
     @Test
     public void test3() {
+        solution1 = new _298.Solution1();
+        solution2 = new _298.Solution2();
         TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, null, null, 4, 4, null, 5, null, null, 6));
         TreeUtils.printBinaryTree(root);
         assertEquals(4, solution1.longestConsecutive(root));
