1004 Counting Leaves （30 分）

判断树每层有多少个叶子节点

DFS

PAT测试点

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;
int max_h=1;
int leaf[maxn]={0};
vector<int> G[maxn];
void DFS(int index, int h){
	max_h = max(h, max_h);
	if(G[index].size()==0){
		leaf[h]++;
		return;
	}
	for(int i=0;i<G[index].size();i++){
		DFS(G[index][i],h+1);
	}
}
int main(){
	
	int N,M,parent,k,child;
	scanf("%d%d",&N,&M);
	for(int i=0;i<M;i++){
		scanf("%d%d",&parent,&k);
		for(int j=0;j<k;j++){
			scanf("%d",&child);
			G[parent].push_back(child);
		}
	}
	DFS(1,1);
	printf("%d",leaf[1]);
	for(int i=2;i<=max_h;i++){
		printf(" %d",leaf[i]);
	}
	return 0;
} 

BFS

牛客网测试点

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 110;
vector<int> G[maxn], res;
int n, m, k, u, x;
void bfs(){
	queue<int> q;
	q.push(1);
	while(q.size()){
		int len = q.size();
		int cnt = 0;
		for(int j = 0; j < len; j++){
			int t = q.front();
			q.pop();
			if(!G[t].size()) cnt++;
			else{
				for(int v = 0; v < G[t].size(); v++){
					int w = G[t][v];
					q.push(w);
				}
			}
		}
		res.push_back(cnt);
	}
}
int main(){
	cin >> n >> m;
	while(m--){
		cin >> u >> k;
		while(k--){
			cin >> x;
			G[u].push_back(x);
		}
	}
	bfs();
	for(int i = 0; i < res.size(); i++){
			cout << res[i];
			if(i != res.size()-1) cout<<" ";
			else cout<<endl;
	} 
	return 0;
}