这题怎么做的?# JobHunting - 待字闺中l*r2010-12-13 08:121 楼一个party N个人,如果一个人不认识任何其他人,又被任何其他人认识,此人为celebrity。用O(n)时间找到此celebrity.
x*p2010-12-13 08:122 楼This is actually a direct graph and we are going to find a node withindegree N-1 and outdegree 0.
l*r2010-12-13 08:123 楼I know, but how to do it in O(N)?【在 x*****p 的大作中提到】: This is actually a direct graph and we are going to find a node with: indegree N-1 and outdegree 0.