l*********r
发帖数: 674 | 1 一个party N个人，如果一个人不认识任何其他人，又被任何其他人认识，此人为
celebrity。用O(n)时间找到此celebrity． |
x*****p
发帖数: 1707 | 2 This is actually a direct graph and we are going to find a node with
indegree N-1 and outdegree 0. |
l*********r
发帖数: 674 | 3 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.
|
I*********g
发帖数: 93 | 4 what is the input?
【在 l*********r 的大作中提到】
: I know, but how to do it in O(N)?
|
a***y
发帖数: 547 | 5 competition graph
【在 l*********r 的大作中提到】
: I know, but how to do it in O(N)?
|
