1094. The Largest Generation (25)[dfs|bfs遍历]
来源:互联网 发布:reference type java 编辑:程序博客网 时间:2024/05/25 21:33
1. 原题:https://www.patest.cn/contests/pat-a-practise/1094
2. 思路:
题意:给出一棵树,找出某层最多的结点数。
思路:比较简单,用DFS或BFS遍历即可。
DFS简洁,这里用的DFS。
思路:比较简单,用DFS或BFS遍历即可。
DFS简洁,这里用的DFS。
已AC:
3. 源码:
#include <iostream>#include <vector>using namespace std;vector< vector<int> > family;//邻接表表示树vector<int> levels;int maxNum = 0;int maxLevel = 0;void dfs(int index, int level);//深度搜索优先int main(void){//freopen("in.txt", "r", stdin);int N, M;cin >> N >> M;family.resize(N + 1);levels.resize(N + 1, 0);for (int i = 0; i < M; i++)//构建邻接表{int parent, childNum, child;cin >> parent >> childNum;for (int j = 0; j < childNum; j++){cin >> child;family[parent].push_back(child);}}dfs(1, 1);cout << maxNum << ' ' << maxLevel << endl;return 0;}void dfs(int index, int level){levels[level]++;if (levels[level] > maxNum)//判断最值。{maxNum = levels[level];maxLevel = level;}for (int i = 0; i < family[index].size(); i++)//递归遍历{dfs(family[index][i], level + 1);}return;}
0 0
- 1094. The Largest Generation (25)[dfs|bfs遍历]
- 1094. The Largest Generation (25)-PAT甲级真题(bfs,dfs,树的遍历)
- PAT 1094. The Largest Generation (25)(bfs遍历)
- The Largest Generation(DFS)
- PAT 1094. The Largest Generation(BFS)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- 1094. The Largest Generation (25)
- Maven依赖Scope标签用法
- 关于matlab生成随机数
- lintcode 二叉树总结
- HDU1385
- 超详细 在linux环境部署oracle 的学习心得(系统部署持续更新~~)
- 1094. The Largest Generation (25)[dfs|bfs遍历]
- Microsoft office2010产品密钥
- 卷积神经网络Lenet-5实现
- 函数的参数拓展
- CCFCSP201509-1数列分段
- C++ typedef typename 作用
- Tensorflow cnn网络 vgg可视化
- Web浏览器中动态添加修改HTML页面代码的问题分析
- Android 多渠道定制化打包