1004_Counting Leaves (30分)[bfs/dfs]

bfs:记录层序

#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxSize = 500 + 10;
int N, M, K, Root, vRoot, maxLevel;
vector<int> nodes[maxSize];
int level[maxSize], book[maxSize];

void bfs() {
    level[1] = 0; //默认1号为根节点,其处在第0层
    maxLevel = 0; //输出范围(树的层数)
    queue<int> que;
    que.push(1);
    while (!que.empty()) {
        int v = que.front();
        que.pop();
        if (nodes[v].size() == 0) book[level[v]]++; //该节点无子节点
        for (int i = 0; i < nodes[v].size(); i++) { //该节点有子节点
            que.push(nodes[v][i]);
            level[nodes[v][i]] = level[v] + 1; //标志子节点的层数
        }
        maxLevel = max(maxLevel, level[v]);
    }
}

int main()
{
    while (cin >> N >> M) {
        memset(nodes, 0, sizeof(nodes));
        memset(level, 0, sizeof(level));
        memset(book, 0, sizeof(book));
        for (int i = 0; i < M; i++) {
            cin >> Root >> K;
            for (int j = 0; j < K; j++) {
                cin >> vRoot;
                nodes[Root].push_back(vRoot);
            }
        }
        bfs();
        cout << book[0];
        for (int i = 1; i <= maxLevel; i++) {
            cout << " " << book[i];
        }
        cout << endl;
    }
    return 0;
}

dfs:

#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxSize = 500 + 10;
int N, M, K, Root, vRoot, maxLevel;
vector<int> nodes[maxSize];
int book[maxSize];

void dfs(int root,int level) {
    if (nodes[root].size() == 0) {
        book[level]++;
        maxLevel = max(maxLevel, level);
        return;
    }
    for (int i = 0; i < nodes[root].size(); i++) {
        dfs(nodes[root][i], level + 1);
    }
}

int main()
{
    while (cin >> N >> M) {
        memset(nodes, 0, sizeof(nodes));
        memset(book, 0, sizeof(book));
        for (int i = 0; i < M; i++) { //关联表建树
            cin >> Root >> K;
            for (int j = 0; j < K; j++) {
                cin >> vRoot;
                nodes[Root].push_back(vRoot);
            }
        }
        maxLevel = 0;
        dfs(1,0); //根节点1,为第0层
        cout << book[0];
        for (int i = 1; i <= maxLevel; i++) {
            cout << " " << book[i];
        }
        cout << endl;
    }
    return 0;
}