寻找重复的子树(序列化+哈希表)
问题:
思路:
若两个子树是重复的,则它们的先序遍历序列相同,用哈希表记录遍历序列,若当前遍历序列已在哈希表中,则将当前节点作为重复子树的根节点保存在列表中
代码:
/**
* 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 {
public:
string Preorder( TreeNode* root,unordered_map<string,int>& table,vector<TreeNode*>& ans )
{
if( root==NULL )
return "";
string s;
s=to_string( root->val )+","+Preorder( root->left,table,ans )+","+Preorder( root->right,table,ans );
if( table[s]==1 )
ans.push_back( root );
table[s]++;
return s;
}
vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
unordered_map<string,int> table;
vector<TreeNode*> ans;
Preorder( root,table,ans );
return ans;
}
};