zoukankan      html  css  js  c++  java
  • 508 Most Frequent Subtree Sum 出现频率最高的子树和

    详见:https://leetcode.com/problems/most-frequent-subtree-sum/description/

    C++:

    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        vector<int> findFrequentTreeSum(TreeNode* root) {
            vector<int> res;
            int cnt=0;
            unordered_map<int,int> m;
            postorder(root,m,cnt,res);
            return res;
        }
        int postorder(TreeNode* node,unordered_map<int,int> &m,int &cnt,vector<int> &res)
        {
            if(!node)
            {
                return 0;
            }
            int left=postorder(node->left,m,cnt,res);
            int right=postorder(node->right,m,cnt,res);
            int sum=left+right+node->val;
            ++m[sum];
            if(m[sum]>=cnt)
            {
                if(m[sum]>cnt)
                {
                    res.clear();
                }
                res.push_back(sum);;
                cnt=m[sum];
            }
            return sum;
        }
    };
    

     参考:http://www.cnblogs.com/grandyang/p/6481682.html

  • 相关阅读:
    input.file上传图片| FileReader h5新特性
    lua的luasocket程序
    nginx的proxy_set_header
    lua的table.sort
    lua的深拷贝和浅拷贝
    nginx的location匹配
    kong后台接口
    一些程序和工具
    lua的模式匹配
    php的一些语法
  • 原文地址:https://www.cnblogs.com/xidian2014/p/8907606.html
Copyright © 2011-2022 走看看