PAT甲级——Counting Leaves

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

思路分析

构建一棵含有N个节点的树，采用孩子表示法，然后层序遍历这棵树，计算每一层中叶子节点的个数。可以将程序划分为两个部分，输入（创建树），计算和输出。

参考代码

#include<iostream>
#include<stdlib.h>
#include<queue>

using namespace std;

typedef struct PedigreeNode
 {
     int *children;
 }PedigreeNode , *Pedigree;

 void inputTree(Pedigree tree , int m);//输入和创建树

 void outputLevelLeafNodeNumber(Pedigree tree , int n);//结算和输出各层叶子节点个数

 int main()
 {
     int n,m;
     cin>>n>>m;

     //初始化
     Pedigree pdtree = (Pedigree)malloc((n+1)*sizeof(PedigreeNode));//带头节点，0号为头节点
     if(!pdtree)return -2;

     for(int i = 0 ; i<n ; i++)
     {
         pdtree[i].children = NULL;
     }

     //输入数据并且创建树
     inputTree(pdtree , m);

     //计算每一层的叶子节点并且输出
     outputLevelLeafNodeNumber(pdtree , n);

     return 0;
 }

 void inputTree(Pedigree tree, int m)
 {
     int this_node=0;
     for(int i = 0 ; i<m ; i++)
     {
         cin>>this_node;
         int children_number;
         cin>>children_number;
         tree[this_node].children = (int * )malloc((children_number+1)*sizeof(int));//0号位置存放孩子的个数
         tree[this_node].children[0] = children_number;
         for(int j = 1 ; j<=children_number ; j++)
         {
             int child;
             cin>>child;
             tree[this_node].children[j] = child;
         }
     }
 }

 void outputLevelLeafNodeNumber(Pedigree tree , int n)
 {
     int level_leaf_node_number[n+1];//0号位置存放一共有多少层
     queue<PedigreeNode> level;//工作队列

     int this_level_node_number = 1;//当前层未遍历节点个数
     int next_level_node_number = 0;//下一层未遍历节点个数

     //初始化每层叶子节点个数为0
     for(int i = 0 ;i<n+1;i++)
     {
         level_leaf_node_number[i]=0;
     }

     int i = 1;

     level.push(tree[1]);//根节点入队列

     while(!level.empty())
     {
         PedigreeNode tree_node_buf = level.front();//取队头
         level.pop();//队头出队列
         this_level_node_number--;//当前层未遍历的节点数-1
         if(tree_node_buf.children == NULL)//如果为叶子节点，当前层叶子节点数+1；否则其孩子全部入队列，并且下层未遍历节点数加孩子数
         {
             level_leaf_node_number[i]++;
         }
         else
         {
             for(int j = 1 ; j<=tree_node_buf.children[0] ; j++)
             {
                 level.push(tree[tree_node_buf.children[j]]);
                 next_level_node_number++;
             }
         }

         if(this_level_node_number == 0)//本层遍历完后进入下一层
         {
             this_level_node_number = next_level_node_number;
             next_level_node_number = 0;
             i++;
             level_leaf_node_number[0]++;
         }
     }

     //输出
     cout<<level_leaf_node_number[1];
     for(i = 2 ; i<=level_leaf_node_number[0] ; i++)
     {
         cout<<" "<<level_leaf_node_number[i];
     }
 }