题目链接
题目分析
输出一棵树每层的叶节点个数
注:rootId = 1;结点上限100;
解题思路
1、建树(静态存储)
2、(思路一)层序遍历(BFS)
结构体保存层号,遍历时赋值并记录叶节点;
3、(思路二)先序遍历(DFS)
AC程序(C++)
/**********************************
*@ID: 3stone
*@ACM: PAT.A1004 Counting Leaves
*@Time: 19/2/16
*@IDE: VScode 2018 + clang++
***********************************/
#include<cstdio>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
using namespace std;
const int maxn = 110;
struct node{
int layer; //保存结点的层次
vector<int> child;
}tree[maxn];
int leaves[maxn]; //统计同一层的叶子结点数,下标为层数
int maxLayer;
void levelTraversal(int root) {
queue<int> Q;
tree[root].layer = 0;
Q.push(root);
while(!Q.empty()) {
int front = Q.front();
Q.pop();
for(int i = 0; i < tree[front].child.size(); i++) {
int child = tree[front].child[i];
Q.push(child);
tree[child].layer = tree[front].layer + 1; //更新层数
}
if(tree[front].child.size() == 0) {
leaves[tree[front].layer]++; //记录叶子结点数
if(maxLayer < tree[front].layer) //更新最大层次
maxLayer = tree[front].layer;
}
}
}//levelTraversal
int main() {
int M, N, K, id, tempChild;
while(scanf("%d%d", &N, &M) != EOF) {
if(N == 0) break; //输入结束
fill(leaves, leaves + maxn, 0);
for(int i = 1; i <= M; i++) {
scanf("%d%d", &id, &K);
for(int j = 0; j < K; j++){
scanf("%d", &tempChild);
tree[id].child.push_back(tempChild);
}//for-j
}//for-i
//根节点为1号
maxLayer = 0;
levelTraversal(1);
for(int i = 0; i < maxLayer; i++) {
printf("%d ", leaves[i]);
}
printf("%d\n", leaves[maxLayer]);
}
system("pause");
return 0;
}
AC程序(思路二)
/**************************
*@Author: 3stone
*@ACM: PAT.A1004 Counting Leaves
*@Time: 18/7/27
*@IDE: VSCode 2018 + clang
***************************/
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#define maxn 105
using namespace std;
//树(静态存储 简化形式)
vector<int> child[maxn];
int level[maxn], node_dep[maxn];
int max_depth;
//先序遍历
void pre_order(int root, int depth) {
if(child[root].size() == 0)
level[depth]++;
for(int i = 0; i < child[root].size(); i++) {
pre_order(child[root][i], depth + 1);
}
if(depth > max_depth) max_depth = depth;
}
int main() {
int n, m;
int k, child_num, temp;
while(scanf("%d %d", &n, &m) != EOF) {
//初始化 结点信息
for(int i = 0; i < maxn; i++) {
child[i].clear();
}
memset(level, 0, sizeof(level));
//输入并保存结点行
for(int i = 1; i <= m; i++) {
scanf("%d %d", &k, &child_num);
for(int j = 0; j < child_num; j++) {
scanf("%d", &temp);
child[k].push_back(temp);
}
}
//先序遍历(DFS)
pre_order(1, 0);
for(int i = 0; i < max_depth; i++)
printf("%d ", level[i]);
printf("%d\n", level[max_depth]);
}//while-scanf
return 0;
}