Leetcode 997. Find the Town Judge

最新推荐文章于 2026-03-28 07:15:00 发布

原创最新推荐文章于 2026-03-28 07:15:00 发布 · 560 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeedCode365 同时被 2 个专栏收录

68 篇文章

订阅专栏

算法和数据结构

44 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的人际信任关系中找出可能存在的小镇法官。该算法通过分析信任数组，判断是否存在满足特定条件的个体，即小镇法官，其不信任任何人但被所有人信任。

In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge.

If the town judge exists, then:

The town judge trusts nobody.
Everybody (except for the town judge) trusts the town judge.
There is exactly one person that satisfies properties 1 and 2.
You are given trust, an array of pairs trust[i] = [a, b] representing that the person labelled a trusts the person labelled b.

If the town judge exists and can be identified, return the label of the town judge. Otherwise, return -1.

Example 1:
Input: N = 2, trust = [[1,2]]
Output: 2
Example 2:
Input: N = 3, trust = [[1,3],[2,3]]
Output: 3
Example 3:
Input: N = 3, trust = [[1,3],[2,3],[3,1]]
Output: -1
Example 4:
Input: N = 3, trust = [[1,2],[2,3]]
Output: -1
Example 5:
Input: N = 4, trust = [[1,3],[1,4],[2,3],[2,4],[4,3]]
Output: 3
Note:

1 <= N <= 1000
trust.length <= 10000
trust[i] are all different
trust[i][0] != trust[i][1]
1 <= trust[i][0], trust[i][1] <= N

public int findJudge(int N, int[][] trust) {
        label: for (int i = 1; i <= N; i++) {
            boolean out = true;
            boolean beTrusted = false;
            for (int[] arr : trust) {
                if (arr[0] == i) {
                    out &= false;
                    continue label;
                } else {
                    out &= true;
                }
            }
            if (out) {
                int count = 0;
                for (int[] arr : trust) {
                    if (arr[1] == i) {
                        count++;
                    }
                }
                if (count+1 == N) return i;
            }
        }
        return -1;
    }