refactor 297

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_297.java

@@ -48,17 +48,17 @@ public TreeNode deserialize(String data) {
             }
 
             String[] nodes = data.split(" ");
-            TreeNode root = new TreeNode(Integer.valueOf(nodes[0]));
+            TreeNode root = new TreeNode(Integer.parseInt(nodes[0]));
             Queue<TreeNode> queue = new LinkedList();
             queue.offer(root);
             for (int i = 1; i < nodes.length; i++) {
                 TreeNode curr = queue.poll();
                 if (!nodes[i].equals("#")) {
-                    curr.left = new TreeNode(Integer.valueOf(nodes[i]));
+                    curr.left = new TreeNode(Integer.parseInt(nodes[i]));
                     queue.offer(curr.left);
                 }
                 if (!nodes[++i].equals("#")) {
-                    curr.right = new TreeNode(Integer.valueOf(nodes[i]));
+                    curr.right = new TreeNode(Integer.parseInt(nodes[i]));
                     queue.offer(curr.right);
                 }
             }

src/test/java/com/fishercoder/_297Test.java

@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._297;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _297Test {
+    private static _297.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _297.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, null, null, 4, 5, 6, 7));
+        TreeUtils.printBinaryTree(root);
+        String str = solution1.serialize(root);
+        System.out.println(str);
+        TreeUtils.printBinaryTree(solution1.deserialize(str));
+        assertEquals(root, solution1.deserialize(str));
+    }
+
+}