Commit 0ed1134

committed

Update 0501.二叉搜索树中的众数,添加C#版

1 parent bc7f72c commit 0ed1134Copy full SHA for 0ed1134

File tree

+40

-0

lines changed

+40

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1009,6 +1009,46 @@ pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {`
`1009`	`1009`	`res`
`1010`	`1010`	`}`
`1011`	`1011`	```
	`1012`	`+### C#`
	`1013`	+```C#
	`1014`	`+// 递归`
	`1015`	`+public class Solution`
	`1016`	`+{`
	`1017`	`+ public List<int> res = new List<int>();`
	`1018`	`+ public int count = 0;`
	`1019`	`+ public int maxCount = 0;`
	`1020`	`+ public TreeNode pre = null;`
	`1021`	`+ public int[] FindMode(TreeNode root)`
	`1022`	`+ {`
	`1023`	`+ SearchBST(root);`
	`1024`	`+ return res.ToArray();`
	`1025`	`+ }`
	`1026`	`+ public void SearchBST(TreeNode root)`
	`1027`	`+ {`
	`1028`	`+ if (root == null) return;`
	`1029`	`+ SearchBST(root.left);`
	`1030`	`+ if (pre == null)`
	`1031`	`+ count = 1;`
	`1032`	`+ else if (pre.val == root.val)`
	`1033`	`+ count++;`
	`1034`	`+ else`
	`1035`	`+ count = 1;`
	`1036`	`+`
	`1037`	`+ pre = root;`
	`1038`	`+ if (count == maxCount)`
	`1039`	`+ {`
	`1040`	`+ res.Add(root.val);`
	`1041`	`+ }`
	`1042`	`+ else if (count > maxCount)`
	`1043`	`+ {`
	`1044`	`+ res.Clear();`
	`1045`	`+ res.Add(root.val);`
	`1046`	`+ maxCount = count;`
	`1047`	`+ }`
	`1048`	`+ SearchBST(root.right);`
	`1049`	`+ }`
	`1050`	`+}`
	`1051`	+```
`1012`	`1052`
`1013`	`1053`
`1014`	`1054`	`<p align="center">`

Comments

(0)