pat 1004 Counting Leaves (30)
来源:互联网 发布:用java计算时间差 编辑:程序博客网 时间:2024/06/06 17:26
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 childfor 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 Input2 101 1 02Sample Output
0 1
求第k层的叶子结点数目,可用深搜,在深搜时递归的时候顺便求出二叉树的层数。
#include<iostream>using namespace std;#include<string.h>#include<stdio.h>#include<queue>#define MS(a,b) memset(a,b,sizeof(a))#include<vector>#include<algorithm>vector<int>tree[200];int ans[200],mm;void dfs(int u,int depth){ int i; mm=max(mm,depth); if(tree[u].size()==0)//如果为叶子结点 { ans[depth]++;//该层数目+1; return ; } for(i=0;i<tree[u].size();i++) dfs(tree[u][i],depth+1);}int main(){ /*#ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif*/ int n,m,id,k,num,i,j; scanf("%d %d",&n,&m); for(i=0;i<m;i++) { scanf("%d %d",&id,&k); for(j=0;j<k;j++) { scanf("%d",&num); tree[id].push_back(num); } } MS(ans,0); mm=-1; dfs(1,1); for(i=1;i<mm;i++) printf("%d ",ans[i]); printf("%d\n",ans[i]); return 0;}
- pat 1004 Counting Leaves (30)
- 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 (30) Python
- PAT (甲)1004 Counting Leaves (30)(dfs)
- PAT甲级 1004 Counting Leaves (30)
- PAT-A | 1004 | Counting Leaves
- PAT甲级1004Counting Leaves
- 1004. Counting Leaves (30)-PAT
- pat 1004. Counting Leaves (30)
- 【PAT】1004. Counting Leaves (30)
- MFC一些理解
- Spark应用(app jar)发布到Hadoop集群的过程
- 常用javascript笔记(不断追加中)
- ubuntu 下shadowsockets配置
- 命令行操作 sqlite 数据库
- pat 1004 Counting Leaves (30)
- 教你初步了解红黑树
- HDOJ 1070 Milk
- [Redis] redis入门
- zk create() 方法
- Linux安装MySQL的两种方法
- 获取当前段和行
- Activity与Fragment的生命周期
- 浅谈前端与SEO