博客围绕PAT考试中统计家族血统树里无子女成员的题目展开。先给出原题及英文输入输出规范，接着进行中文翻译。解题思路是利用树的遍历，采用bfs对树的每一层遍历，queue存叶子节点子节点，非叶子节点记入答案，最后给出代码。
原题
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:
ID K ID[1] ID[2] ... ID[K]
where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.
The input ends with N being 0. That case must NOT be processed.
Output Specification:
For each test case, yo
最低0.47元/天 解锁文章
扫一扫
1280
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
