[LeetCode] 997. Find the Town Judge

- Problem

997. Find the Town Judge

- 내 풀이

class Solution:
    def findJudge(self, n: int, trust: List[List[int]]) -> int:
        graph = [0] * (n+1)

        for a, b in trust:
            graph[a] -= 1
            graph[b] += 1
        
        for i in range(1, n+1):
            if graph[i] == n-1:
                return i
        
        return -1

• 시간 복잡도: O(N)
• 공간 복잡도: O(N)

- 결과