本文主要是介绍LeetCode 题解(263) : 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.
C++版：
// 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) {int j = i + 1;while(j < n && !knows(i, j))j++;if(j == n)break;i = j;}for(int k = 0; k < n; k++) {if(k != i) {if(!knows(k, i) || knows(i, k))return -1;}}return i;}
};Python版：
# The knows API is already defined for you.
# @param a, person a
# @param b, person b
# @return a boolean, whether a knows b
# def knows(a, b):class Solution(object):def findCelebrity(self, n):""":type n: int:rtype: int"""i = 0while i < n:j = i + 1while j < n and not knows(i, j):j += 1if j == n:breaki = jfor k in range(n):if k == i:continueif not knows(k, i) or knows(i, k):return -1return i这篇关于LeetCode 题解(263) : Find the Celebrity的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
