Commit0522cd8

committed

refactor 116

1 parentd5335de commit0522cd8Copy full SHA for 0522cd8

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,9 @@`
`2`	`2`
`3`	`3`	`importcom.fishercoder.common.classes.TreeLinkNode;`
`4`	`4`
	`5`	`+importjava.util.LinkedList;`
	`6`	`+importjava.util.Queue;`
	`7`	`+`
`5`	`8`	`publicclass_116 {`
`6`	`9`	`publicstaticclassSolution1 {`
`7`	`10`	`/**`
`@@ -44,4 +47,35 @@ public void connect(TreeLinkNode root) {`
`44`	`47`	`}`
`45`	`48`	`}`
`46`	`49`	`}`
	`50`	`+`
	`51`	`+publicstaticclassSolution2 {`
	`52`	`+/**`
	`53`	`+ * My complete original solution on 10/10/2021.`
	`54`	`+ */`
	`55`	`+publicTreeLinkNodeconnect(TreeLinkNoderoot) {`
	`56`	`+if (root ==null) {`
	`57`	`+returnnull;`
	`58`	`+ }`
	`59`	`+Queue<TreeLinkNode>queue =newLinkedList<>();`
	`60`	`+queue.offer(root);`
	`61`	`+while (!queue.isEmpty()) {`
	`62`	`+intsize =queue.size();`
	`63`	`+for (inti =0;i <size;i++) {`
	`64`	`+TreeLinkNodecurr =queue.poll();`
	`65`	`+if (i <size -1) {`
	`66`	`+curr.next =queue.peek();`
	`67`	`+ }else {`
	`68`	`+curr.next =null;`
	`69`	`+ }`
	`70`	`+if (curr.left !=null) {`
	`71`	`+queue.offer(curr.left);`
	`72`	`+ }`
	`73`	`+if (curr.right !=null) {`
	`74`	`+queue.offer(curr.right);`
	`75`	`+ }`
	`76`	`+ }`
	`77`	`+ }`
	`78`	`+returnroot;`
	`79`	`+ }`
	`80`	`+ }`
`47`	`81`	`}`

Comments

(0)