关于PAT 1004 Counting leaves 的疑问
来源:互联网 发布:安卓 windows 如何切换 编辑:程序博客网 时间:2024/06/05 18:29
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input
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.
Output
For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.
The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output “0 1” in a line.
Sample Input
2 1
01 1 02
Sample Output
0 1
注:leaf node
以下是我自己的代码,用dfs解决。答案都正确,但存在段错误,找了很久找不到原因。另外,代码还有其他不好的地方也可以指出来,希望有大神帮帮忙~
#include <iostream>#include <vector>using namespace std;int ans[500] = { 0 }; // 每层中的叶结点数int max_level = -1;struct Node { int id; int child_num; // 子结点总数 vector<int> vec; Node(int _id, int _child_num) { id = _id; child_num = _child_num; }};Node* all[500]; // 所有结点void dfs(Node* node, int level) { if (level > max_level) max_level = level; if (node->child_num == 0) ans[level]++; for (int i = 0; i < node->child_num; i++) { if (all[node->vec[i]] != NULL) { dfs(all[node->vec[i]], level + 1); } }}int main(int argc, char const *argv[]) { int m, n, id, k, x; cin >> n >> m; for (int i = 0; i < 100; i++) all[i] = NULL; for (int i = 0; i < m; i++) { cin >> id >> k; Node* temp = new Node(id, k); for (int j = 0; j < k; j++) { cin >> x; (temp->vec).push_back(x); if (all[x] == NULL) all[x] = new Node(x, 0); } all[id] = temp; } dfs(all[1], 0); for (int i = 0; i < max_level; i++) { cout << ans[i] << " "; } cout << ans[max_level]; return 0;}
- 关于PAT 1004 Counting leaves 的疑问
- pat 1004 Counting Leaves
- pat 1004 counting Leaves
- PAT 1004 Counting Leaves
- PAT 1004 Counting Leaves
- pat 1004 Counting Leaves
- pat 1004 Counting Leaves
- PAT 1004 Counting Leaves
- PAT 1004 Counting Leaves
- PAT 1004 Counting Leaves
- PAT-A | 1004 | Counting Leaves
- pat 1004 Counting Leaves (30)
- PAT甲级1004Counting Leaves
- 浙大PAT 1004题 1004. Counting Leaves
- Pat(Advanced Level)Practice--1004(Counting Leaves)
- PAT Advanced Level 1004:Counting Leaves
- PAT (Advanced Level) Practise 1004 Counting Leaves
- PAT 1004 Counting Leaves (30) Python
- 字符串单词反转
- SDUT2134数据结构实验之栈四:括号匹配(栈)
- 数据库存储全方案,详解持久化技术
- linux之shell
- MySQL 入门(上)
- 关于PAT 1004 Counting leaves 的疑问
- java虚拟机系列--内存分配与垃圾回收机制
- Java进阶之内存管理与垃圾回收
- poj 2377 Bad Cowtractors
- 使用Jedis连接Redis
- 拷贝继承(call+拷贝继承)
- 《剑指offer》的又三个面试题
- 多线程编程入门(6):一道线程同步与通信面试题
- python 遍历某个路径下的所有图片并将图片路径保存到数组