PTA甲级1004

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

结尾无空行

思路解释：

1、who have no child for every seniority level starting from the root.翻译：输出从根节点开始每一行没有孩子的结点数（只要输出到这个树的最大深度即可，后面的0可以省略）

2、dfs函数有两个形参，一个是开始节点startnode，一个是当前深度nowdepth，dfs需要对最大深度进行记录，当nowdepth>maxDepth时，maxDepth = nowdepth；并且dfs到叶子结点时，leafnum[nowdepth]++，表示当前深度的叶子结点数+1。

3、对vector孩子结点的数组遍历时，因为相当于进入更深层的孩子结点，startnode变为当前孩子结点，nowdepth也要+1。

Tips：第三步要写成++nowdepth，如果写成nowdeph++则表示先dfs，nowdepth再+1，显然是不符合题意的

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

int N, M;
vector<int> child[100];
int maxDepth, leafnum[100] = { 0 };

void dfs(int startnode, int nowdepth) {
	if (nowdepth > maxDepth) maxDepth = nowdepth;
	if (!child[startnode].empty()) {
		for (auto c : child[startnode]) {
			dfs(c, ++nowdepth);
		}
	}
	else {
		leafnum[nowdepth]++;
		return;
	}
}
int main() {
	cin >> N >> M;//N为节点数，M为非叶子节点数
	int id, k;
	for (int i = 0; i < M; i++) {
		cin >> id >> k;
		for (int j= 1; j<= k; j++) {
			int temp;
			cin >> temp;
			child[id].push_back(temp);
		}
	}
	maxDepth = 1;
	dfs(1, 1);
	for (int i = 1; i <= maxDepth; i++) {
		if (i > 1) cout << " ";
		cout << leafnum[i];
	}
}