501. 二叉搜索树中的众数

发表于 更新于 分类于
这是文章开头，显示在主页面，详情请点击此处。
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
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def __init__(self):
        self.maxValue = 0
        self.count = 0
        self.pre = None
        self.result = [] 
    def findMode(self, root: Optional[TreeNode]) -> List[int]:
        if root==None: 
            return 
        self.findMode(root.left)
        if self.pre==None: 
            self.count = 1
        if self.pre!=None and root.val==self.pre.val:
            self.count += 1
            # print('!!!')
        else:
            self.count = 1
        self.pre = root 
        if self.maxValue == self.count:
            self.result.append(root.val)
        elif self.maxValue < self.count:
            self.maxValue = self.count 
            self.result = [root.val] 
        # print(self.result,self.maxValue,self.count)
        self.findMode(root.right)
        return self.result