Commit99a181b

committed

refactor 297

1 parent2e146cb commit99a181bCopy full SHA for 99a181b

File tree

+34

-3

lines changed

src
- main/java/com/fishercoder/solutions
  - _297.java
- test/java/com/fishercoder
  - _297Test.java

+34

-3

lines changed

Lines changed: 3 additions & 3 deletions

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`		`-TreeNoderoot =newTreeNode(Integer.valueOf(nodes[0]));`
	`51`	`+TreeNoderoot =newTreeNode(Integer.parseInt(nodes[0]));`
`52`	`52`	`Queue<TreeNode>queue =newLinkedList();`
`53`	`53`	`queue.offer(root);`
`54`	`54`	`for (inti =1;i <nodes.length;i++) {`
`55`	`55`	`TreeNodecurr =queue.poll();`
`56`	`56`	`if (!nodes[i].equals("#")) {`
`57`		`-curr.left =newTreeNode(Integer.valueOf(nodes[i]));`
	`57`	`+curr.left =newTreeNode(Integer.parseInt(nodes[i]));`
`58`	`58`	`queue.offer(curr.left);`
`59`	`59`	`}`
`60`	`60`	`if (!nodes[++i].equals("#")) {`
`61`		`-curr.right =newTreeNode(Integer.valueOf(nodes[i]));`
	`61`	`+curr.right =newTreeNode(Integer.parseInt(nodes[i]));`
`62`	`62`	`queue.offer(curr.right);`
`63`	`63`	`}`
`64`	`64`	`}`

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.common.classes.TreeNode;`
	`4`	`+importcom.fishercoder.common.utils.TreeUtils;`
	`5`	`+importcom.fishercoder.solutions._297;`
	`6`	`+importorg.junit.BeforeClass;`
	`7`	`+importorg.junit.Test;`
	`8`	`+`
	`9`	`+importjava.util.Arrays;`
	`10`	`+`
	`11`	`+importstaticorg.junit.Assert.assertEquals;`
	`12`	`+`
	`13`	`+publicclass_297Test {`
	`14`	`+privatestatic_297.Solution1solution1;`
	`15`	`+`
	`16`	`+@BeforeClass`
	`17`	`+publicstaticvoidsetup() {`
	`18`	`+solution1 =new_297.Solution1();`
	`19`	`+ }`
	`20`	`+`
	`21`	`+@Test`
	`22`	`+publicvoidtest1() {`
	`23`	`+TreeNoderoot =TreeUtils.constructBinaryTree(Arrays.asList(1,2,3,null,null,4,5,6,7));`
	`24`	`+TreeUtils.printBinaryTree(root);`
	`25`	`+Stringstr =solution1.serialize(root);`
	`26`	`+System.out.println(str);`
	`27`	`+TreeUtils.printBinaryTree(solution1.deserialize(str));`
	`28`	`+assertEquals(root,solution1.deserialize(str));`
	`29`	`+ }`
	`30`	`+`
	`31`	`+}`

Comments

(0)