LeetCode 851. Loud and Rich - 拓扑排序（Topological Sort）系列题10

CP Coding

于 2021-12-15 12:07:54 发布

阅读量708

点赞数

分类专栏： Leetcode刷题笔记拓扑排序(Topological Sort) 文章标签： leetcode 算法职场和发展 python 数据结构

本文链接：https://blog.csdn.net/hgq522/article/details/121943770

版权

本文介绍了如何利用拓扑排序解决LeetCode 851问题，该问题要求找到比给定人物有钱或同样有钱但最不安静的人。通过分析richer数组和quiet数组，可以发现通过拓扑排序可以确定这种关系，并实时更新答案，无需记录所有父节点。

摘要由CSDN通过智能技术生成

There is a group of n people labeled from 0 to n - 1 where each person has a different amount of money and a different level of quietness.

You are given an array richer where richer[i] = [ai, bi] indicates that ai has more money than bi and an integer array quiet where quiet[i] is the quietness of the ith person. All the given data in richer are logically correct (i.e., the data will not lead you to a situation where x is richer than y and y is richer than x at the same time).

Return an integer array answer where answer[x] = y if y is the least quiet person (that is, the person y with the smallest value of quiet[y]) among all people who definitely have