We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e7000fe commit f231f1dCopy full SHA for f231f1d
scripts/algorithms/F/Find Duplicate Subtrees/Find Duplicate Subtrees.cpp
@@ -1,23 +1,24 @@
1
+// Runtime: 41 ms (Top 93.16%) | Memory: 44.5 MB (Top 70.83%)
2
class Solution {
3
public:
4
unordered_map<string,int> dp ;
5
vector<TreeNode*> ans ;
-
6
+
7
string solve(TreeNode * root){
8
if(!root) return "" ;
9
10
string left = solve(root->left) ;
11
string right = solve(root->right) ;
12
13
string code = to_string(root->val) + " " + left + " " + right ;
14
if(dp[code] == 1) ans.push_back(root) ;
15
dp[code]++ ;
16
17
return code ;
18
}
19
20
vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
21
string dummy = solve(root) ;
22
return ans ;
23
-};
24
+};
0 commit comments