PAT-A 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 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

思路：简单层序遍历。

代码：

#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

typedef struct Node
{
    int level;         // 该结点所在层数
    vector<int> child; // 孩子的编号
}node;

const int maxn = 101;
node tree[maxn];
int n, m;
vector<int> ans;   // 每一层的非叶子结点数量


int main()
{
    scanf("%d%d", &n, &m);
    if(n == 0)
        return 0;
    for(int i = 0; i < m; i++)
    {
        int id, k;
        scanf("%d%d", &id, &k);
        node tem;
        for(int j = 0; j < k; j++)
        {
            int c;
            scanf("%d", &c);
            tem.child.push_back(c);
        }
        tree[id] = tem;
    }

    queue<node> q;
    tree[1].level = 0;
    q.push(tree[1]);

    int level = 0; // 记录上一个结点的层级
    int counter = 0; // 记录一个层级中非叶子结点的数量
    while(!q.empty())
    {
        node now = q.front();
        q.pop();
        if(level != now.level)
        {
            ans.push_back(counter);
            level++;
            counter = 0;
        }
        if(now.child.size() == 0)
            counter++;
        else
        {
            for(int i = 0; i < now.child.size(); i++)
            {
                int child = now.child[i];
                tree[child].level = now.level + 1;
                q.push(tree[child]);
            }
        }
    }
    ans.push_back(counter); // 保存最后一层的非叶子结点的数量
    for(int i = 0; i < ans.size(); i++)
    {
        if(i != 0)
            printf(" ");
        printf("%d", ans[i]);
    }
    return 0;
}