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

This commit is contained in:
eeee0717
2023-12-03 09:41:53 +08:00
parent bc7f72cad7
commit 0ed1134870

View File

@ -1009,6 +1009,46 @@ pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
res
}
```
### C#
```C#
// 递归
public class Solution
{
public List<int> res = new List<int>();
public int count = 0;
public int maxCount = 0;
public TreeNode pre = null;
public int[] FindMode(TreeNode root)
{
SearchBST(root);
return res.ToArray();
}
public void SearchBST(TreeNode root)
{
if (root == null) return;
SearchBST(root.left);
if (pre == null)
count = 1;
else if (pre.val == root.val)
count++;
else
count = 1;
pre = root;
if (count == maxCount)
{
res.Add(root.val);
}
else if (count > maxCount)
{
res.Clear();
res.Add(root.val);
maxCount = count;
}
SearchBST(root.right);
}
}
```
<p align="center">