A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:
ID K ID[1] ID[2] ... ID[K]
where ID
is a two-digit number representing a given non-leaf node, K
is the number of its children, followed by a sequence of two-digit ID
's of its children. For the sake of simplicity, let us fix the root ID to be 01
.
The input ends with N being 0. That case must NOT be processed.
Output Specification:
For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.
The sample case represents a tree with only 2 nodes, where 01
is the root and 02
is its only child. Hence on the root 01
level, there is 0
leaf node; and on the next level, there is 1
leaf node. Then we should output 0 1
in a line.
Sample Input:
2 1
01 1 02
结尾无空行
Sample Output:
0 1
结尾无空行
用DFS对每一层 每一个结点判断 维护最大层数以及每一层的叶子节点数(对每一个结点都存放他的孩子数,如果为零就是叶子结点)
#include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
vector<int>child[100]; //节点中有几个孩子
int leaves_num[100]={0},maxlevel=0; //最大层次
void dfs(int curnode,int curlevel){
if(curlevel>maxlevel)maxlevel=curlevel; //更新最大节点
if(child[curnode].size()){ //如果当前节点孩子不为零 那么就继续遍历下一层
for(int it=0;it<child[curnode].size();it++){
dfs(it,curlevel+1); //遍历所有的孩子 层次加一
}
}else {
leaves_num[curlevel]++; //如果不存在孩子 (叶子结点) 那么当前层次的叶子数++
}
}
int main()
{
int N,M,ID,k,node;
cin>>N>>M;
for(int i=1;i<=M;i++){
cin>>ID>>k;
for(int i=1;i<=k;i++){
cin>>node;
child[ID].push_back(node); //第ID个节点中存放了k个孩子
}
}
dfs(1,1); //当前节点,当前层次
for(int i=1;i<=maxlevel;i++){
if(i>1)cout<<" ";
cout<<leaves_num[i];
//cout<<i;
}
}