LeetCode --- 997. Find the Town Judge 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 997. Find the Town Judge 解题报告相关的知识,希望对你有一定的参考价值。
In a town, there are n
people labeled 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 an array trust
where trust[i] = [ai, bi]
representing that the person labeled ai
trusts the person labeled bi
.
Return the label of the town judge if the town judge exists and can be identified, or return -1
otherwise.
Example 1:
Input: n = 2, trust = [[1,2]] Output: 2
Example 2:
Input: n = 3, trust = [[1,3],
以上是关于LeetCode --- 997. Find the Town Judge 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 997. Find the Town Judge
LeetCode --- 997. Find the Town Judge 解题报告
LeetCode --- 997. Find the Town Judge 解题报告
Leetcode-997 Find the Town Judge(?????????????????????)