refactor 297

fishercoder1534 · fishercoder1534 · commit 99a181bbb1b9 · 2021-11-01T13:58:45.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_297.java b/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);
                 }
             }
diff --git a/src/test/java/com/fishercoder/_297Test.java b/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));
+    }
+
+}

Original file line number	Diff line number	Diff line change
`@@ -48,17 +48,17 @@ public TreeNode deserialize(String data) {`
`48`	`48`	`}`
`49`	`49`
`50`	`50`	`String[] nodes = data.split(" ");`
`51`		`- TreeNode root = new TreeNode(Integer.valueOf(nodes[0]));`
	`51`	`+ TreeNode root = new TreeNode(Integer.parseInt(nodes[0]));`
`52`	`52`	`Queue<TreeNode> queue = new LinkedList();`
`53`	`53`	`queue.offer(root);`
`54`	`54`	`for (int i = 1; i < nodes.length; i++) {`
`55`	`55`	`TreeNode curr = queue.poll();`
`56`	`56`	`if (!nodes[i].equals("#")) {`
`57`		`- curr.left = new TreeNode(Integer.valueOf(nodes[i]));`
	`57`	`+ curr.left = new TreeNode(Integer.parseInt(nodes[i]));`
`58`	`58`	`queue.offer(curr.left);`
`59`	`59`	`}`
`60`	`60`	`if (!nodes[++i].equals("#")) {`
`61`		`- curr.right = new TreeNode(Integer.valueOf(nodes[i]));`
	`61`	`+ curr.right = new TreeNode(Integer.parseInt(nodes[i]));`
`62`	`62`	`queue.offer(curr.right);`
`63`	`63`	`}`
`64`	`64`	`}`