Commit cfc78c3

committed

Update111.二叉树的最小深度,添加C#版

1 parent 3ffca33 commit cfc78c3Copy full SHA for cfc78c3

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 43 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -708,6 +708,49 @@ impl Solution {`
`708`	`708`	`}`
`709`	`709`	`}`
`710`	`710`	```
	`711`	`+### C#`
	`712`	+```C#
	`713`	`+// 递归`
	`714`	`+public int MinDepth(TreeNode root)`
	`715`	`+{`
	`716`	`+ if (root == null) return 0;`
	`717`	`+ int left = MinDepth(root.left);`
	`718`	`+ int right = MinDepth(root.right);`
	`719`	`+ if (root.left == null && root.right != null)`
	`720`	`+ return 1+right;`
	`721`	`+ else if(root.left!=null && root.right == null)`
	`722`	`+ return 1+left;`
	`723`	`+`
	`724`	`+ int res = 1 + Math.Min(left, right);`
	`725`	`+ return res;`
	`726`	`+}`
	`727`	+```
	`728`	+```C#
	`729`	`+// 迭代`
	`730`	`+public int MinDepth(TreeNode root)`
	`731`	`+{`
	`732`	`+ if (root == null) return 0;`
	`733`	`+ int depth = 0;`
	`734`	`+ var que = new Queue<TreeNode>();`
	`735`	`+ que.Enqueue(root);`
	`736`	`+ while (que.Count > 0)`
	`737`	`+ {`
	`738`	`+ int size = que.Count;`
	`739`	`+ depth++;`
	`740`	`+ for (int i = 0; i < size; i++)`
	`741`	`+ {`
	`742`	`+ var node = que.Dequeue();`
	`743`	`+ if (node.left != null)`
	`744`	`+ que.Enqueue(node.left);`
	`745`	`+ if (node.right != null)`
	`746`	`+ que.Enqueue(node.right);`
	`747`	`+ if (node.left == null && node.right == null)`
	`748`	`+ return depth;`
	`749`	`+ }`
	`750`	`+ }`
	`751`	`+ return depth;`
	`752`	`+}`
	`753`	+```
`711`	`754`
`712`	`755`	`<p align="center">`
`713`	`756`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

Comments

(0)