1004 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 

 

public class Main {
    static Scanner sc=new Scanner(System.in);
    static int n=sc.nextInt();//结点总数
    static int m=sc.nextInt();//非叶子结点
    static HashMap<Integer,int[]> tree=new HashMap<>();//存储树，key：父亲结点编号,value:对应的孩子结点
    static int[] leafNum=new int[100];//每层的叶子结点树
    public static void main(String[] args) {
        for(int i=0;i<m;i++){
            int nodeId=sc.nextInt();
            int k=sc.nextInt();
            int[] nodes=new int[k];
            for(int j=0;j<k;j++){
                nodes[j]=sc.nextInt();
            }
            tree.put(nodeId,nodes);
        }
        dfs(1,0);
        int sum=0;
        int num=0;
        for(int i=0;i<leafNum.length;i++){
            int j=leafNum[i];
            sum+=j;
            if(sum==n-m){
                num=i;
                break;
            }
        }
        for(int i=0;i<=num;i++){
            if(i==num){
                System.out.println(leafNum[i]);
            }else{
                System.out.print(leafNum[i]+" ");
            }
        }
    }
    public static void dfs(int node,int deep){
        if(!tree.containsKey(node)){
            leafNum[deep]++;
            return;
        }

        int[] nodelist=tree.get(node);
        for(int i=0;i<nodelist.length;i++){
            dfs(nodelist[i],deep+1);
        }
    }
}