PAT(甲) - 1004 Counting Leaves

使用bfs进行搜索

#include <bits/stdc++.h>
using namespace std;

typedef struct Node
{
    vector<struct Node *> child;
} node;

node tree[100];
queue<node *> q;

int main()
{
    // ios::sync_with_stdio(false);
    int n, m;
    while (cin >> n)
    {
        if (n == 0)
            break;
        for (int i = 0; i < 100; i++)
        {
            tree[i].child.clear();
        }
        cin >> m;
        for (int i = 0; i < m; i++)
        {
            int s;
            scanf("%02d", &s);
            // cout << s << endl;
            int k;
            scanf("%d", &k);
            for (int j = 0; j < k; j++)
            {
                int c;
                scanf("%02d", &c);
                tree[s].child.push_back(&tree[c]);
            }
        }
        while (!q.empty())
            q.pop();
        q.push(&tree[1]);
        node *end = &tree[1];
        node *end_temp;
        int sum = 0;
        int first = 0;
        while (!q.empty())
        {
            node *t = q.front();
            q.pop();
            int flag = 0;
            for (auto v : t->child)
            {
                q.push(v);
                flag = 1;
                end_temp = v;
            }
            if (flag == 0)
                sum++;
            if (t == end)
            {
                end = end_temp;
                if (!first)
                {
                    cout << sum;
                    first = 1;
                }
                else
                    cout << " " << sum;
                sum = 0;
            }
        }
        cout << endl;
    }
}