Leetcode Problem 851. Loud and Rich

851. Loud and Rich

Leetcode Solutions

Initialize an adjacency list to represent the graph based on the richer array.
Initialize an array answer with the same length as quiet and fill it with -1, indicating that we have not computed the answer for that person yet.
For each person i, if answer[i] is -1, call the dfs function on that person.
Implement the dfs function that takes a person x and returns the quietest person in the subtree rooted at x.
If answer[x] is not -1, return answer[x] as it has already been computed.
Otherwise, set answer[x] to x initially, and for each child y of x in the graph, update answer[x] to the quieter person between answer[x] and dfs(y).
Return answer[x].
After processing all people, return the answer array.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen