Commit abc55ed

committed

feat(0226): 新增java bfs写法

1 parent 43b094e commit abc55edCopy full SHA for abc55ed

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -205,6 +205,7 @@ public:`
`205`	`205`	`Java:`
`206`	`206`
`207`	`207`	```Java
	`208`	`+//DFS递归`
`208`	`209`	`class Solution {`
`209`	`210`	`/**`
`210`	`211`	`* 前后序遍历都可以`
`@@ -226,6 +227,31 @@ class Solution {`
`226`	`227`	`root.right = tmp;`
`227`	`228`	`}`
`228`	`229`	`}`
	`230`	`+`
	`231`	`+//BFS`
	`232`	`+class Solution {`
	`233`	`+ public TreeNode invertTree(TreeNode root) {`
	`234`	`+ if (root == null) {return null;}`
	`235`	`+ ArrayDeque<TreeNode> deque = new ArrayDeque<>();`
	`236`	`+ deque.offer(root);`
	`237`	`+ while (!deque.isEmpty()) {`
	`238`	`+ int size = deque.size();`
	`239`	`+ while (size-- > 0) {`
	`240`	`+ TreeNode node = deque.poll();`
	`241`	`+ swap(node);`
	`242`	`+ if (node.left != null) {deque.offer(node.left);}`
	`243`	`+ if (node.right != null) {deque.offer(node.right);}`
	`244`	`+ }`
	`245`	`+ }`
	`246`	`+ return root;`
	`247`	`+ }`
	`248`	`+`
	`249`	`+ public void swap(TreeNode root) {`
	`250`	`+ TreeNode temp = root.left;`
	`251`	`+ root.left = root.right;`
	`252`	`+ root.right = temp;`
	`253`	`+ }`
	`254`	`+}`
`229`	`255`	```
`230`	`256`
`231`	`257`	`Python:`

Comments

(0)