Given a tree (i.e. a connected, undirected graph that has no cycles) consisting of n
nodes numbered from 0
to n - 1
and exactly n - 1
edges
. The root of the tree is the node 0
, and each node of the tree has a label which is a lower-case character given in the string labels
(i.e. The node with the number i
has the label labels[i]
).
The edges
array is given on the form edges[i] = [ai, bi]
, which means there is an edge between nodes ai
and bi
in the tree.
Return an array of size n
where ans[i]
is the number of nodes in the subtree of the ith
node which have the same label as node i
.
A subtree of a tree T
is the tree consisting of a node in T
and all of its descendant nodes.
Example 1:
Input: n = 7, edges = [[0,1],[0,2],[1,4],[1,5],[2,3],[2,6]], labels = "abaedcd"
Output: [2,1,1,1,1,1,1]
Explanation: Node 0 has label 'a' and its sub-tree has node 2 with label 'a' as well, thus the answer is 2. Notice that any node is part of its sub-tree.
Node 1 has a label 'b'. The sub-tree of node 1 contains nodes 1,4 and 5, as nodes 4 and 5 have different labels than node 1, the answer is just
思路:这题其实就是个DFS的思路,每次往上传递char array的信息;建立好无向图之后,用传递father参数来避免回去访问的问题;只要neighbor != father,这点就可以保证是继续往下走的。这个技巧学习了。
class Solution {
public int[] countSubTrees(int n, int[][] edges, String labels) {
int[] res = new int[n];
HashMap<Integer, List<Integer>> graph = new HashMap<>();
for(int i = 0; i < n; i++) {
graph.putIfAbsent(i, new ArrayList<Integer>());
}
for(int[] edge: edges) {
graph.get(edge[0]).add(edge[1]);
graph.get(edge[1]).add(edge[0]);
}
dfs(0, -1, n, graph, labels, res);
return res;
}
private int[] dfs(int cur, int father, int n,
HashMap<Integer, List<Integer>> graph, String labels, int[] res) {
int[] count = new int[26];
count[labels.charAt(cur) - 'a']++;
for(Integer neighbor: graph.get(cur)) {
if(neighbor != father) {
int[] ncount = dfs(neighbor, cur, n, graph, labels, res);
for(int i = 0; i < 26; i++) {
count[i] += ncount[i];
}
}
}
res[cur] = count[labels.charAt(cur) - 'a'];
return count;
}
}