GoLang Solution For LeetCode Problem: Loud and Rich
Solving Loud and Rich in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: richer = [[1,0],[2,1],[3,1],[3,7],[4,3],[5,3],[6,3]], quiet = [3,2,5,4,6,1,7,0] Output: [5,5,2,5,4,5,6,7] Explanation: answer = 5. Person 5 has more money than 3, which has more money than 1, which has more money than 0. The only person who is quieter (has lower quiet[x]) is person 7, but it isn't clear if they have more money than person 0. answer = 7. Among all people that definitely have equal to or more money than person 7 (which could be persons 3, 4, 5, 6, or 7), the person who is the quietest (has lower quiet[x]) is person 7. The other answers can be filled out with similar reasoning.
1 <= quiet.length = N <= 500
0 <= richer.length <= N * (N-1) / 2
0 <= richer[i][j] < N
richer[i] != richer[i]
richer[i]'s are all different.
- 1 <= quiet.length = N <= 500
- 0 <= richer.length <= N * (N-1) / 2
- 0 <= richer[i][j] < N
- richer[i] != richer[i]
See the full details of the problem Loud and Rich at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go