PAT甲级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

想法：第一次做深搜的题，参考了下面的文章https://blog.csdn.net/qq_34360094/article/details/87539559

因数据结构还在学习中，所以有以下几点对解完这道的体会：
（1）深搜和二叉树的前序遍历很像
（2）解决这道题，我感觉主要考虑两个方面，一个是对数据的存储（树）第二个是算法（深搜），存储使用了二维动态数组，而深搜使用了递归的形式（与树的遍历很像，有递归和堆栈两种形式，树其实应该是特殊的图）

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;

vector<int> vct[101];
int flag[101]={0};
int level_num[101]={0};
int max_level=0;

void DFS(int index, int level)
{
    if(level>max_level)
        max_level=level;
    if(vct[index].size()==0)
        level_num[level]++;
    for(int i=0; i<vct[index].size(); i++){
        if(flag[vct[index][i]]==0){
            flag[vct[index][i]]=1;
            DFS(vct[index][i],level+1);
        }
    }
}

int main()
{
    int N,M;
    scanf("%d %d",&N,&M);
    while(M--){
        int x,y,z;
        scanf("%d %d",&x,&y);
        while(y--){
            scanf(" %d",&z);
            vct[x].push_back(z);
        }
    }
    DFS(1,0);
    for(int i=0; i<=max_level; i++){
        if(i==0)
            printf("%d",level_num[i]);
        else
            printf(" %d",level_num[i]);
    }
    return 0;
}