🥉

Find the Town Judge

Created

2022/01/03 10:36

문제 번호

997

카테고리

Array

Hash Table

Graph

Find the Town Judge - LeetCode

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.

https://leetcode.com/problems/find-the-town-judge/

Code

제출 날짜	시간	메모리
2021/01/03	100 ms	7.4 MB

// 997. Fidn the Town Judge
//
// https://leetcode.com/problems/find-the-town-judge/

// There is a sole 'town judge' in the town. findJudge function finds the judge.
// The judge does not trust anyone, and others trust the judge.
// By using two maps, record the person who is trusting other and the person who is trusted.
// The answer is that the person who is trusted n - 1 (except the self) and does not trust anyone.
func findJudge(n int, trust [][]int) int {
	if n == 1 {
		return 1
	}
	person := make([]bool, n+1)
	trusted := make(map[int]int)
	for _, r := range trust {
		person[r[0]] = true
		trusted[r[1]]++
	}
	for i, bit := range person {
		if bit == false && trusted[i] == n-1 {
			return i
		}
	}
	return -1
}
Go
복사