Commit 301026b

authored

Merge pull request youngyangyang04#632 from ColorQian/master

添加 0102.二叉树的层序遍历.md文件中的 111.二叉树的最小深度的java代码

2 parents 68159f8 + f07fb2f commit 301026bCopy full SHA for 301026b

File tree

+37

-0

lines changed

+37

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1623,6 +1623,43 @@ public:`
`1623`	`1623`	```
`1624`	`1624`
`1625`	`1625`	`Java:`
	`1626`	+```java
	`1627`	`+class Solution {`
	`1628`	`+`
	`1629`	`+ public int minDepth(TreeNode root){`
	`1630`	`+ if (root == null) {`
	`1631`	`+ return 0;`
	`1632`	`+ }`
	`1633`	`+`
	`1634`	`+ Queue<TreeNode> queue = new LinkedList<>();`
	`1635`	`+ queue.offer(root);`
	`1636`	`+ int depth = 0;`
	`1637`	`+`
	`1638`	`+ while (!queue.isEmpty()){`
	`1639`	`+`
	`1640`	`+ int size = queue.size();`
	`1641`	`+ depth++;`
	`1642`	`+`
	`1643`	`+ TreeNode cur = null;`
	`1644`	`+ for (int i = 0; i < size; i++) {`
	`1645`	`+ cur = queue.poll();`
	`1646`	`+`
	`1647`	`+ //如果当前节点的左右孩子都为空,直接返回最小深度`
	`1648`	`+ if (cur.left == null && cur.right == null){`
	`1649`	`+ return depth;`
	`1650`	`+ }`
	`1651`	`+`
	`1652`	`+ if (cur.left != null) queue.offer(cur.left);`
	`1653`	`+ if (cur.right != null) queue.offer(cur.right);`
	`1654`	`+ }`
	`1655`	`+`
	`1656`	`+`
	`1657`	`+ }`
	`1658`	`+`
	`1659`	`+ return depth;`
	`1660`	`+ }`
	`1661`	`+}`
	`1662`	+```
`1626`	`1663`
`1627`	`1664`
`1628`	`1665`	`Python 3:`

Comments

(0)