[LeetCode277]Find the Celebrity

Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know him/her but he/she does not know any of them.

Now you want to find out who the celebrity is or verify that there is not one. The only thing you are allowed to do is to ask questions like: "Hi, A. Do you know B?" to get information of whether A knows B. You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).

You are given a helper function bool knows(a, b) which tells you whether A knows B. Implement a function int findCelebrity(n), your function should minimize the number of calls to knows.

Note: There will be exactly one celebrity if he/she is in the party. Return the celebrity's label if there is a celebrity in the party. If there is no celebrity, return -1.

Hide Company Tags LinkedIn
Hide Tags Array

这题看着特别复杂，其实逻辑超级简单。有n个人，编号从0到n-1.有一个或者0个celebrity。我们可以traverse 每个人两遍就可以找到这个celebrity了。
条件：every one knows x && x doesn’t known anyone.

所以O(n) code:

class Solution {
public:
    int findCelebrity(int n) {
        int candidate = 0;
        for(int i = 1; i < n; ++i){
            if(knows(candidate,i)) candidate = i;// or !(i,candidate) : current people dont know candidate;
        }
        for(int i = 0; i<n; ++i){
            if( i != candidate && (!knows(i, candidate) || knows(candidate, i))) return -1;
        }
        return candidate;
    }
};

之所以可以这样做，是因为celebrity number <= 1!