pat 1004 Counting Leaves (30 分)
1)解题思路:dfs或者bfs
//dfs方式
#include <iostream>
#include <vector>
using namespace std;
vector<int> node[101];
int maxLayers;
int leaves[101] = {0};
void dfs(int index, int layers){
if(!node[index].size()){
leaves[layers]++;
maxLayers = max(maxLayers, layers);
return;
}
for(int i = 0; i < node[index].size(); i++){
// dfs(node[index].front(), layers + 1);
// node[index].pop_back();
dfs(node[index][i], layers + 1);
}
}
int main(){
int N, M, id, k, idk;
cin >> N >> M;
for(int i = 0; i < M; i++){
cin >> id >> k;
for(int j = 0; j < k; j++){
cin >> idk;
node[id].push_back(idk);
}
}
dfs(1, 0);
cout << leaves[0];
for(int i = 1; i <= maxLayers; i++){
cout << " " << leaves[i];
}
return 0;
}
2)对于题目中规定首节点为1而不是0的,最好数组使用时将0空出(也可以全部-1,但是这样容易导致中间概念出错)
3)由于设计层数,使用dfs递归的方式更容易一些,可以将depth直接作为递归变量;而使用bfs则需要输入后保存每个节点的层数(也是根据父节点层数+1)
注:bfs的实现只通过了部分样例,暂时未找到错误原因;
大佬看出来了可以和我说一下,感谢!
//bfs方式,但是只能通过部分样例,有大佬看出来了可以和我说一下,感谢!
#include <iostream>
#include <queue>
using namespace std;
struct Node{
int layer = -1;
int childNum = 0;
int child[105];
};
Node node[105];
int main(){
int N, M;
cin >> N >> M;
node[1].layer = 0;
int Hlayers = 0;
for(int i = 0; i < M; i++){
int id, num;
cin >> id >> num;
node[id].childNum = num;
for(int j = 0; j < node[id].childNum; j++){
cin >> node[id].child[j];
node[ node[id].child[j] ].layer = node[id].layer + 1;
if(i == M - 1){
Hlayers = node[id].layer + 1;
}
}
}
// cout << "layers:" << Hlayers << endl;
queue<Node> q;
q.push(node[1]);
int leaves[101] = {0};
while(!q.empty()){
Node tq = q.front();
q.pop();
if(!tq.childNum){
// cout << "0 " << tq.layer<<endl;
leaves[tq.layer]++;
}else {
for(int i = 0; i < tq.childNum; i++){
q.push(node[tq.child[i] ]);
}
}
}
cout << leaves[0];
for(int i = 1; i < Hlayers + 1; i++){
cout << " " << leaves[i];
}
return 0;
}