Merge pull request #1979 from CodingTestStudy2/최원준

[최원준] Day05

Author: github-actions[bot]

leetcode3/최원준/851. Loud and Rich.py

@@ -0,0 +1,31 @@
+class Solution:
+    def loudAndRich(self, richer: List[List[int]], quiet: List[int]) -> List[int]:
+        n = len(quiet)
+
+        graph = [[] for _ in range(n)]
+
+        for rich, poor in richer:
+            graph[poor].append(rich)
+
+        answer = [-1] * n
+
+        def dfs(x):
+            # 이미 계산했다면 재사용
+            if answer[x] != -1:
+                return answer[x]
+
+            # 자기 자신도 후보
+            answer[x] = x
+
+            for rich in graph[x]:
+                candidate = dfs(rich)
+
+                if quiet[candidate] < quiet[answer[x]]:
+                    answer[x] = candidate
+
+            return answer[x]
+
+        for i in range(n):
+            dfs(i)
+
+        return answer