LeetCode #277 - 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.

名人的定义是，他不认识其他所有人，但是其他人都认识他。那我们可以从0号开始，找之后是否有他认识的人，如果他认识i，说明他不是名人。那么我们直接从i开始，再往后找是否有他认识的人。从i开始的原因在于0不认识1到i-1的所有人，那么这些人都不可能是名人。

// Forward declaration of the knows API.
bool knows(int a, int b);
class Solution {
public:
    int findCelebrity(int n) {
        int i=0;
        while(i<n)
        {   
            bool flag=true;
            int j=i+1;
            while(j<n)
            {
                if(knows(i,j)) 
                {
                    flag=false;
                    break;
                }
                j++;
            }
            if(flag) break;
            else i=j;
        }
        
        for(int k=0;k<n;k++)
            if(i!=k&&(knows(i,k)||!knows(k,i))) return -1;
        return i;
    }
};