[leetcode] 1519. Number of Nodes in the Sub-Tree With the Same Label

Description

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 1 (the node itself).

Example 2:

Input: n = 4, edges = [[0,1],[1,2],[0,3]], labels = "bbbb"
Output: [4,2,1,1]
Explanation: The sub-tree of node 2 contains only node 2, so the answer is 1.
The sub-tree of node 3 contains only node 3, so the answer is 1.
The sub-tree of node 1 contains nodes 1 and 2, both have label 'b', thus the answer is 2.
The sub-tree of node 0 contains nodes 0, 1, 2 and 3, all with label 'b', thus the answer is 4.

Example 3:

Input: n = 5, edges = [[0,1],[0,2],[1,3],[0,4]], labels = "aabab"
Output: [3,2,1,1,1]

Example 4:

Input: n = 6, edges = [[0,1],[0,2],[1,3],[3,4],[4,5]], labels = "cbabaa"
Output: [1,2,1,1,2,1]

Example 5:

Input: n = 7, edges = [[0,1],[1,2],[2,3],[3,4],[4,5],[5,6]], labels = "aaabaaa"
Output: [6,5,4,1,3,2,1]

Constraints:

• 1 <= n <= 10^5
• edges.length == n - 1
• edges[i].length == 2
• 0 <= ai, bi < n
• ai != bi
• labels.length == n
• labels is consisting of only of lower-case English letters.

分析

题目的意思是：给定一棵树，找出每棵树的子树中于当前节点有相同label的节点的数量。这道题首先要把树构造成一个无向图，然后进行深度优先搜索。

• 构建无向图的原因可参考下面的例子，如果构成有向图，其中1->2就不太容易遍历到，构造成无向图能够避免这种情况

4
[[0,2],[0,3],[1,2]]
"aeed"

• 为了避免重复查找，可以把父节点当成参数辅助判断；如果当前节点的下一个接待你是父节点就跳过，否则就继续递归。
• 递归的时候注意记录子树的label统计，把与当前节点的label统计加入到结果集合res中，然后把label统计当成返回值传递给上一层。

代码

class Solution:
    def dfs(self,cur,parent,graph,labels):
        d=defaultdict(int)
        d[labels[cur]]+=1
        for nei in graph[cur]:
            if(nei!=parent):
                d1=self.dfs(nei,cur,graph,labels)
                for k,v in d1.items():
                    d[k]+=d1[k]
        self.res[cur]=d[labels[cur]]
        return d
                
        
    
    def countSubTrees(self, n: int, edges: List[List[int]], labels: str) -> List[int]:
        graph=defaultdict(list)
        for edge in edges:
            graph[edge[0]].append(edge[1])
            graph[edge[1]].append(edge[0])
            
        self.res=[0]*n
        self.dfs(0,-1,graph,labels)
        return self.res

参考文献

Number of Nodes in the Sub-Tree With the Same Label