-
Notifications
You must be signed in to change notification settings - Fork 120
/
Copy path0501-FindModeInBinarySearchTree.cs
57 lines (49 loc) · 1.5 KB
/
0501-FindModeInBinarySearchTree.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//-----------------------------------------------------------------------------
// Runtime: 240ms
// Memory Usage: 33.1 MB
// Link: https://leetcode.com/submissions/detail/352843520/
//-----------------------------------------------------------------------------
using System.Collections.Generic;
namespace LeetCode
{
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class _0501_FindModeInBinarySearchTree
{
private List<int> result = new List<int>();
private int count, modelCount, prevValue;
public int[] FindMode(TreeNode root)
{
InOrder(root);
return result.ToArray();
}
private void InOrder(TreeNode node)
{
if (node == null) return;
InOrder(node.left);
if (prevValue != node.val) count = 1;
else count++;
if (count > modelCount)
{
result.Clear();
result.Add(node.val);
modelCount = count;
}
else if (count == modelCount)
result.Add(node.val);
prevValue = node.val;
InOrder(node.right);
}
}
}