Commit 4c14916

authored

Merge pull request youngyangyang04#2340 from eeee0717/master

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

2 parents 2e33887 + eb0504e commit 4c14916Copy full SHA for 4c14916

File tree

+93

-0

lines changed

+93

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -908,6 +908,31 @@ impl Solution {`
`908`	`908`	`}`
`909`	`909`	`}`
`910`	`910`	```
	`911`	`+### C#`
	`912`	+```C#
	`913`	`+public bool IsBalanced(TreeNode root)`
	`914`	`+{`
	`915`	`+ return GetHeight(root) == -1 ? false : true;`
	`916`	`+}`
	`917`	`+public int GetHeight(TreeNode root)`
	`918`	`+{`
	`919`	`+ if (root == null) return 0;`
	`920`	`+ int left = GetHeight(root.left);`
	`921`	`+ if (left == -1) return -1;`
	`922`	`+ int right = GetHeight(root.right);`
	`923`	`+ if (right == -1) return -1;`
	`924`	`+ int res;`
	`925`	`+ if (Math.Abs(left - right) > 1)`
	`926`	`+ {`
	`927`	`+ res = -1;`
	`928`	`+ }`
	`929`	`+ else`
	`930`	`+ {`
	`931`	`+ res = 1 + Math.Max(left, right);`
	`932`	`+ }`
	`933`	`+ return res;`
	`934`	`+}`
	`935`	+```
`911`	`936`
`912`	`937`	`<p align="center">`
`913`	`938`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

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">`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -867,6 +867,31 @@ impl Solution {`
`867`	`867`	`}`
`868`	`868`	`}`
`869`	`869`	```
	`870`	`+### C#`
	`871`	+```C#
	`872`	`+// 递归`
	`873`	`+public int CountNodes(TreeNode root)`
	`874`	`+{`
	`875`	`+ if (root == null) return 0;`
	`876`	`+ var left = root.left;`
	`877`	`+ var right = root.right;`
	`878`	`+ int leftDepth = 0, rightDepth = 0;`
	`879`	`+ while (left != null)`
	`880`	`+ {`
	`881`	`+ left = left.left;`
	`882`	`+ leftDepth++;`
	`883`	`+ }`
	`884`	`+ while (right != null)`
	`885`	`+ {`
	`886`	`+ right = right.right;`
	`887`	`+ rightDepth++;`
	`888`	`+ }`
	`889`	`+ if (leftDepth == rightDepth)`
	`890`	`+ return (int)Math.Pow(2, leftDepth+1) - 1;`
	`891`	`+ return CountNodes(root.left) + CountNodes(root.right) + 1;`
	`892`	`+`
	`893`	`+}`
	`894`	+```
`870`	`895`
`871`	`896`	`<p align="center">`
`872`	`897`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

Comments

(0)