PAT1004甲级 java

2020/7/5

问题

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, 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.
概要：求树的叶子节点

树的层次遍历java

class TreeNode{
    int value=0;
    TreeNode left=null;
    TreeNode right=null;

    public TreeNode(int value){
        this.value=value;//节点的值
    }
}
//层次遍历
    public void laywertraversal(TreeNode root){
        if(root==null) return;
        LinkedList<TreeNode> list=new LinkedList<TreeNode>();
        list.add(root);
        TreeNode currentnode;
        while (!list.isEmpty()){
            currentnode=list.poll();//获取第一个元素并删除
            System.out.println(currentnode.value);
            if(currentnode.left!=null){
                list.add(currentnode.left);
            }
            if(currentnode.right!=null){
                list.add(currentnode.right);
            }
        }
    }

1004解题java

import java.util.*;


public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();//结点数
        int m=sc.nextInt();//非叶子结点数
        int record[][]=new int[n+1][n+1];//二维数组存储一个二维数组的根节点和他们的子节点
        for(int i=0;i<m;i++){
            int ID=sc.nextInt();//结点的值
            int k=sc.nextInt();//结点的孩子个数
            for(int j=0;j<k;j++){
                int id=sc.nextInt();//孩子结点
                record[ID][id]=1;
            }
        }
        LinkedList<Integer> q = new LinkedList<Integer>();
        q.offer(1);//队列的增添操作，表示队列有root值
        int p=1;
        int count=0;
        while (!q.isEmpty()){
            int now=q.poll();//删除第一个元素（同时可获取）
            boolean flag=false;//记录该节点是否有子节点
            for(int i=1;i<=n;i++){
                if(record[now][i]!=0){
                    q.offer(i);//将子结点加入队列
                    flag=true;
                }
            }
            if(!flag){//叶子结点
                count++;
            }
            if(now==p){
                if(!q.isEmpty()) p=q.getLast();
                if(now==1){
                    System.out.print(count);
                }else {
                    System.out.print(" "+count);
                }
                count=0;
            }

        }
    }
}

注：java中树的遍历是重点，需详细复习
解题代码详情可参见https://blog.csdn.net/qq_40639828/article/details/105865424