PAT Counting Leaves C++ 44行

https://pintia.cn/problem-sets/994805342720868352/problems/994805521431773184

思路

可用层序遍历 用leafcnt数组 根据层号记录叶子数

AC代码

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct {
	int layer;
	vector<int> child;
}node[100];
int leafcnt[100]={0},maxlay=1;
void level() {
	queue<int> q;
	int p;
	node[1].layer=1;
	q.push(1);
	while (!q.empty()) {
		p=q.front(),q.pop();
		if (node[p].child.size()==0)	//叶子结点 统计数量
			++leafcnt[node[p].layer];
		if (node[p].layer>maxlay)	//记录最大层号 做输出边界
			maxlay=node[p].layer;
		for (int i=0; i<node[p].child.size(); ++i) {
			int child=node[p].child[i];
			node[child].layer=node[p].layer+1;
			q.push(child);
		}
	}
}
int main(){
	int n,m;
	cin>>n>>m;
	for (int i=0,father,childnum; i<m; ++i) {
		cin>>father>>childnum;
		for (int j=0,temp; j<childnum; ++j) {
			cin>>temp;
			node[father].child.push_back(temp);
		}
	}
	level();
	for (int i=1; i<=maxlay; ++i) {
		if (i>1)
			printf(" ");
		printf("%d",leafcnt[i]);
	}
}