Skip to content

Commit 0c7fde1

Browse files
committed
Create 652. 寻找重复的子树.js
1 parent 9ed02a3 commit 0c7fde1

File tree

1 file changed

+63
-0
lines changed

1 file changed

+63
-0
lines changed

652. 寻找重复的子树.js

Lines changed: 63 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,63 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* function TreeNode(val, left, right) {
4+
* this.val = (val===undefined ? 0 : val)
5+
* this.left = (left===undefined ? null : left)
6+
* this.right = (right===undefined ? null : right)
7+
* }
8+
*/
9+
/**
10+
* @param {TreeNode} root
11+
* @return {TreeNode[]}
12+
*/
13+
var findDuplicateSubtrees = function (root) {
14+
const result = [];
15+
const map = {};
16+
17+
function dfs(node) {
18+
if (!node) {
19+
return 'null';
20+
}
21+
const arr = [node.val, ...dfs(node.left), ...dfs(node.right)];
22+
const key = arr.join(',');
23+
if (map[key] === 1) {
24+
result.push(node);
25+
map[key] = 2;
26+
} else if (!map[key]) {
27+
map[key] = 1;
28+
}
29+
return arr;
30+
}
31+
dfs(root);
32+
33+
return result;
34+
};
35+
36+
function arrayToTree(arr) {
37+
function TreeNode(val) {
38+
this.val = val;
39+
this.left = this.right = null;
40+
}
41+
if (arr.length === 0) {
42+
return null;
43+
}
44+
const root = new TreeNode(arr[0]);
45+
const list = [root];
46+
let i = 1;
47+
while (list.length > 0) {
48+
const node = list.shift();
49+
if (typeof arr[i] === 'number') {
50+
node.left = new TreeNode(arr[i]);
51+
list.push(node.left);
52+
}
53+
i++;
54+
if (typeof arr[i] === 'number') {
55+
node.right = new TreeNode(arr[i]);
56+
list.push(node.right);
57+
}
58+
i++;
59+
}
60+
return root;
61+
}
62+
63+
console.log(findDuplicateSubtrees(arrayToTree([0, 0, 0, 0, null, null, 0, null, null, null, 0])));

0 commit comments

Comments
 (0)