1004 Counting Leaves (30分)

最新推荐文章于 2022-07-26 16:28:25 发布

han_hhh

最新推荐文章于 2022-07-26 16:28:25 发布

阅读量117

点赞数

分类专栏：其他程序设计题目

本文链接：https://blog.csdn.net/han_hhh/article/details/107573955

版权

其他程序设计题目专栏收录该内容

42 篇文章 2 订阅

订阅专栏

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<iostream>
#include<vector>
#include<cstring>
using namespace std;
vector<int> childnode[101];
int leafs[101];   //每一层叶子节点的数量 
int maxdepth=-1;   //最大深度，初始化为-1 
void dfs(int node,int depth){
	if(childnode[node].size()==0){   //说明该点是叶子节点 
		leafs[depth]++;
		maxdepth=max(maxdepth,depth);
		return ; 
	}
	for(int i=0;i<childnode[node].size();i++){
		dfs(childnode[node][i],depth+1);
	} 
} 
int main(){
	int n,m;
	memset(leafs,0,sizeof(leafs));
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++){
		int id,k;
		scanf("%d%d",&id,&k);
		for(int j=0;j<k;j++){
			int idk;
			scanf("%d",&idk);
			childnode[id].push_back(idk);
		}
	}
	dfs(1,0); 
	for(int i=0;i<=maxdepth;i++){
		printf("%d",leafs[i]);
		if(i!=maxdepth){
			printf(" ");
		}
	}
	printf("\n");
	return 0;
}