本文探讨了如何在O(N)的时间复杂度内解决寻找名人的问题。通过定义名人，即除了他自己外，每个人都认识他，而他不认识任何人。文章提出了一种有效的算法，首先找到最后一个可能的名人，然后验证该名人是否认识其他人。
Error:
do not know how to do: definition of celebrity:
- n - 1 knows him
- him do not know n - 1
In order word, if know(A -> B) == true, it means A must not be the celebrity, B may be the celebrity; if know(A -> B) == false, it means A may be the celebrity, B must not be the celebrity.
So first we get the last celebrity which know(A -> B) == false, then check if current celebrity know any of them. O(N) time complexity
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
