/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
//中序遍历
vector<int> answer;
int base,count,maxcount;
void updata(int x)
{
if(x==base)
{
count++;
}
else
{
base=x;
count=1;
}
if(count==maxcount)
{
answer.push_back(base);
}
if(count>maxcount)
{
maxcount=count;
answer=vector<int>{base};
}
}
void dfs(TreeNode *o)
{
if(!o)
{
return;
}
dfs(o->left);
updata(o->val);
dfs(o->right);
}
public:
vector<int> findMode(TreeNode* root) {
dfs(root);
return answer;
}
};
二叉搜索树中的众数
最新推荐文章于 2024-07-25 11:44:32 发布