leetcode 652. Find Duplicate Subtrees Map记录 + 深度优先遍历DFS
来源:互联网 发布:淘宝圭亚那粉趾 编辑:程序博客网 时间:2024/06/07 05:37
Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one of them.
Two trees are duplicate if they have the same structure with same node values.
Example 1:
1
/ \
2 3
/ / \
4 2 4
/
4
The following are two duplicate subtrees:
2
/
4
and
4
Therefore, you need to return above trees’ root in the form of a list.
本题最初的想法就是一个结点一个节点的查询,不过这个需要很多的计算,会很费时间,后来发现一个直接递归的做法,用到了前序遍历(后序遍历也可以,中序遍历不可以),还有数组序列化,并且建立序列化跟其出现次数的映射,这样如果我们得到某个结点的序列化字符串,而该字符串正好出现的次数为1,说明之前已经有一个重复树了,我们将当前结点存入结果res,这样保证了多个重复树只会存入一个结点,参见代码如下:
代码如下:
#include <iostream>#include <vector>#include <map>#include <set>#include <queue>#include <stack>#include <string>#include <climits>#include <algorithm>#include <sstream>#include <functional>#include <bitset>#include <numeric>#include <cmath>#include <regex>using namespace std;/*struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};*/class Solution {public: vector<TreeNode*> res; map<string, int> mmp; vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) { dfs(root); return res; } string dfs(TreeNode* root) { if (root == NULL) return "#"; else { string left = dfs(root->left); string right = dfs(root->right); string id = to_string(root->val) + left + right; if (mmp.find(id) == mmp.end()) mmp[id] = 1; else { if (mmp[id] == 1) res.push_back(root); mmp[id] += 1; } return id; } }};
阅读全文
0 0
- leetcode 652. Find Duplicate Subtrees Map记录 + 深度优先遍历DFS
- [leetcode]652. Find Duplicate Subtrees
- leetcode 652. Find Duplicate Subtrees
- 652. Find Duplicate Subtrees
- 652. Find Duplicate Subtrees
- Leetcode 652. Find Duplicate Subtrees 寻找重复子树 解题报告
- LeetCode 之 DFS 深度优先遍历
- leetcode_652. Find Duplicate Subtrees
- leetcode 513. Find Bottom Left Tree Value 一个简单的DFS深度优先遍历
- 深度优先遍历DFS
- DFS-深度优先遍历
- DFS深度优先遍历
- 深度优先遍历(DFS)
- DFS 深度优先遍历
- 深度优先遍历!!DFS
- DFS 深度优先遍历
- 深度优先遍历DFS
- Find Duplicate Subtrees 解题心得
- android M fingerprint 解析
- springcloud实战之14动态刷新分布式配置中心属性配置(config)
- 我的博客
- MongoDB 分片的原理、搭建、应用(九)
- C语言中操作符的总结
- leetcode 652. Find Duplicate Subtrees Map记录 + 深度优先遍历DFS
- is too old(format 29) to work with client version '1.8.13(r1667537)'(expects format 31). you need to
- MVC几种找不到资源的问题解决办法
- Spring(四)---高级装配(2)
- 通过程序设计几何图形(Shape)、矩形(Rectangle)、圆形(Circle)、正方形(Square)几种类型, 能够利用接口和多态性计算几何图形的面积和周长并显示
- POJ 3096.Surprising Strings
- gradle 使用心得
- QTableWidget 基本操作(一)
- Android——API23以上需要的动态权限