func findJudge(N int, trust [][]int) int {
s, t := make([]int, N+1), make([]bool, N+1)
for _, v := range trust {
s[v[1]]++
t[v[0]] = true
}
res := make([]int, 0)
for i := 1; i < len(s); i++ {
if s[i] == N - 1 && !t[i] {
res = append(res, i)
}
}
if len(res) != 1{
return -1
}
return res[0]
}