PAT甲级1004--二叉树DFS

1004. Counting Leaves (30)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

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.

Output

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

题目大意：给出树的总结点数以及非叶子结点数以及每个非叶子结点的孩子,求出从树根开始的每一层的叶子结点数，并且输出

思路分析：用vector child(i)表示每个飞叶子结点的孩子通过DFS加入deep参数，并且到达一个叶子结点,将此层的叶子结点数加一,如果当前deep>maxdeep 更新最大深度,最后按序输出保存每层叶子结点的数组直到maxdeep

Codes

#include<cstdio>
#include<vector>
using namespace std;
const int maxn=120;
int pop[maxn]={0};
int n,m,maxDepth=0;
vector<int> child[maxn];
void DFS(int index,int depth){
    if(child[index].size()==0){
        pop[depth]++;
        if(depth>maxDepth){
            maxDepth=depth;
        }
        return ;
    }

    for(int i=0;i<child[index].size();i++){
        DFS(child[index][i],depth+1);
    }
}
int main(){
    int index,ch,k;
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%d%d",&index,&k);
        for(int j=0;j<k;j++){
            scanf("%d",&ch);
            child[index].push_back(ch);
        }
    }
    DFS(1,1);
    for(int i=1;i<=maxDepth;i++){
           if(i>1) printf(" ");
           printf("%d",pop[i]);     
    }
    return 0;
}