652. Find Duplicate Subtrees
发布时间:2020-12-14 04:28:54 所属栏目:大数据 来源:网络整理
导读:/* * * 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 : unordered_map string ,vectorTreeNode* s; v
/** * 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: unordered_map<string,vector<TreeNode*>> s; vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) { dfs(root); vector<TreeNode*> res; for (auto & i : s) { if (i.second.size() > 1) res.push_back(i.second[0]); } return res; } string dfs(TreeNode* root) { if (root == NULL) return ""; string t = "(" + dfs(root->left) + to_string(root->val) + dfs(root->right) + ")"; s[t].push_back(root); return t; } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |