*Leetcode 652. Find Duplicate Subtrees | 不错

最新推荐文章于 2022-11-29 03:45:24 发布

Z-Pilgrim

最新推荐文章于 2022-11-29 03:45:24 发布

阅读量160

点赞数

分类专栏： LeetCode题解

本文链接：https://blog.csdn.net/u011026968/article/details/81009042

版权

LeetCode题解专栏收录该内容

271 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/find-duplicate-subtrees/description/

class Solution {
public:
    
    string dfs(TreeNode* root, vector<TreeNode*> &ans, unordered_map<string, TreeNode*>&mem, unordered_set<string> &get) {
        if (!root) return "NULL";

        string cur = to_string(root->val);
        cur += dfs(root->left, ans, mem, get);
        cur += dfs(root->right, ans, mem, get);
 
        if (mem.find(cur) != mem.end()) {
            if (get.find(cur) == get.end()) {
                ans.push_back(root);
                get.insert(cur);
            }
            
        } else {
            mem[cur] = root;
        }
        return cur;
    }
    
    
    vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
        vector<TreeNode*> ans;
        unordered_set<string> tmp;
        unordered_map<string, TreeNode*> mem;
        dfs(root, ans, mem, tmp);

        return ans;
    }
};