PAT(甲级)2024夏季考试A-4

注意几个点:
1.树的根节点入度为0,给的图中可能有多个入度为0的点,也可能没有入度为0的点
2.当只有一个入度为0的点时,深度优先搜索遍历一遍,看是否能到达所有节点,如果不能则退出,能的话还要考虑一种情况,就是图中有环,怎么判断有没有环呢,我们加一下所有不同边的个数为m,如果m 不等于节点个数n - 1的话,说明不是树.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());
        int[] root = new int[n + 1];
        Set<Integer>[] node = new HashSet[n + 1];
        Arrays.setAll(node, i -> new HashSet<>());
        while (true) {
            st = new StringTokenizer(br.readLine());
            int a = Integer.parseInt(st.nextToken());
            if (a == 0) {
                break;
            }
            int b = Integer.parseInt(st.nextToken());
            root[b]++;
            node[a].add(b);
        }
        int r = -1;
        int count = 0;
        for (int i = 1; i <= n; i++) {
            if (root[i] == 0) {
                r = i;
                count++;
            }
        }
        if (count > 1 || count == 0) {
            System.out.print("no " + count);
            return;
        }
        boolean[] isVisited = new boolean[n + 1];
        dfs(r, isVisited, node);
        boolean flag = true;
        for (int i = 1; i <= n; i++) {
            if (!isVisited[i]) {
                flag = false;
                break;
            }
        }
        if (flag) {
            int count1 = 0;
            for (int i = 1; i <= n; i++) {
                if (!node[i].isEmpty()) {
                    count1 += node[i].size();
                }
            }
            if (count1 == n - 1) {
                System.out.println("yes " + r);
            } else {
                System.out.println("no 1");
            }
        } else {
            System.out.println("no 1");
        }
    }

    public static void dfs(int root, boolean[] isVisited, Set<Integer>[] node) {
        isVisited[root] = true;
        for (int e : node[root]) {
            if (!isVisited[e]) {
                dfs(e, isVisited, node);
            }
        }
    }

}