PAT A1004 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 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.

• 题目大意
  给出一棵树，求每层叶子节点数

• 代码实现
  DFS

#include <cstdio>
#include <vector>
using namespace std;
const int MAX = 101;
struct Node{
    vector<int> child;
}node[MAX];
vector<int> ans[MAX];
int Max_Depth = -1;
void DFS(int depth, int root){
    if(node[root].child.size() == 0){
        ans[depth].push_back(root);
        if(depth > Max_Depth)
            Max_Depth = depth;
    }
    for(int i = 0; i < node[root].child.size(); i++){
        DFS(depth + 1,node[root].child[i]);
    }
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < m; i++){
        int father, num;
        scanf("%d%d", &father, &num);
        for(int j = 0; j < num; j++){
            int child;
            scanf("%d", &child);
            node[father].child.push_back(child);
        }
    }
    DFS(0,1);
    for(int i = 0; i <= Max_Depth; i++){
        if(i != Max_Depth )
            printf("%d ", ans[i].size());
        else
            printf("%d", ans[Max_Depth].size());
    }
    return 0;
}

• BFS
  在每层树的节点中增加一个层次信息。

#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int MAX = 101;
struct Node{
    vector<int> child;
    int level;
}node[MAX];
vector<int> ans[MAX];
int Max_Depth = 0;
void BFS(int root){
    queue<int> qu;
    qu.push(root);                   //根节点入队
    node[root].level = 0;
    while(!qu.empty()){
        int top = qu.front();
        qu.pop();
        if(node[top].child.size() == 0){
            ans[node[top].level].push_back(top);
            if(node[top].level > Max_Depth)                 //更新最大层次
                Max_Depth = node[top].level;
        }
        for(int i = 0; i < node[top].child.size(); i++){              //将孩子节点从左往右依次入队，并更新层次
            node[node[top].child[i]].level = node[top].level + 1;
            qu.push(node[top].child[i]);
        }
    }
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < m; i++){
        int father, num;
        scanf("%d%d", &father, &num);
        for(int j = 0; j < num; j++){
            int child;
            scanf("%d", &child);
            node[father].child.push_back(child);
        }
    }
    BFS(1);
    for(int i = 0; i <= Max_Depth; i++){
        if(i != Max_Depth )
            printf("%d ", ans[i].size());
        else
            printf("%d", ans[Max_Depth].size());
    }
    return 0;
}