【算法】图类基础算法题解，LeeCode997. 找到小镇的法官，LeetCode1791. 找出星型图的中心节点，LeetCode1971. 寻找图中是否存在路径

本文链接：https://blog.csdn.net/m0_64491107/article/details/123856924

LeeCode997. 找到小镇的法官

class Solution {
    public int findJudge(int n, int[][] trust) {
        // indeg = n - 1
        // outdeg = 0
		
        int[] indeg = new int[n + 1];
        int[] outdeg = new int[n + 1];

        for (int[] t : trust) {
            int x = t[0];
            int y = t[1];
            indeg[y]++;
            outdeg[x]++;
        }
        // 找到出度是0，入度是 n-1的点
        for (int i = 1; i <= n; i++) {
            if (indeg[i] == n - 1 && outdeg[i] == 0) return i;
        }
        return -1;
    }
}

LeetCode1791. 找出星型图的中心节点

class Solution {
    public int findCenter(int[][] edges) {
        // 建图，找到入度为 edges.length的点
        int n = edges.length + 1;

        int[] indeg = new int[n + 1];

        for (int[] edge : edges) {
            int x = edge[0];
            int y = edge[1];
            // 双向边，入度都++
            indeg[x]++;
            indeg[y]++;
        }

        for (int i = 1; i <= n; i++) {
            if (indeg[i] == edges.length) return i;
        }
        return -1;
    }
}

LeetCode1971. 寻找图中是否存在路径

class Solution {
    List<List<Integer>> to = new ArrayList<>();
    boolean[] visited;
    int destination;
    boolean ans;

    public boolean validPath(int n, int[][] edges, int source, int destination) {
        // 起点和终点相同直接返回
        if (source == destination) return true;

        visited = new boolean[n];
        this.destination = destination;
        ans = false;

        for (int i = 0; i < n; i++) {
            to.add(new ArrayList<>());
        }

        // 建图
        for (int[] edge : edges) {
            int x = edge[0];
            int y = edge[1];
            to.get(x).add(y);
            to.get(y).add(x);
        }

        dfs(source, -1);
        return ans;
    }

    void dfs(int x, int fa) {
        visited[x] = true;

        for (int y : to.get(x)) {
            if (fa == y) continue;
            if (!visited[y]) dfs(y, x);
            // 找到目标 返回true
            if (y == destination) ans = true;
        }
    }
}