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). 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.

Example 1:

Input: graph = [
  [1,1,0],
  [0,1,0],
  [1,1,1]
]
Output: 1
Explanation: There are three persons labeled with 0, 1 and 2. graph[i][j] = 1 means person i knows person j, otherwise graph[i][j] = 0 means person i does not know person j. The celebrity is the person labeled as 1 because both 0 and 2 know him but 1 does not know anybody.

Example 2:

Input: graph = [
  [1,0,1],
  [1,1,0],
  [0,1,1]
]
Output: -1
Explanation: There is no celebrity.

Note:

  1. The directed graph is represented as an adjacency matrix, which is an n x n matrix where a[i][j] = 1 means person i knows person j while a[i][j] = 0 means the contrary.
  2. Remember that you won't have direct access to the adjacency matrix.

这道题让我们在一群人中寻找名人,所谓名人就是每个人都认识他,他却不认识任何人,限定了只有1个或0个名人,给定了一个 API 函数,输入a和b,用来判断a是否认识b,让我们尽可能少的调用这个函数,来找出人群中的名人。博主最先想的方法是建立个一维数组用来标记每个人的名人候选状态,开始均初始化为 true,表示每个人都是名人候选人,然后一个人一个人的验证其是否为名人,对于候选者i,遍历所有其他人j,如果i认识j,或者j不认识i,说明i不可能是名人,那么标记其为 false,然后验证下一个候选者,反之如果i不认识j,或者j认识i,说明j不可能是名人,标记之。对于每个候选者i,如果遍历了一圈而其候选者状态仍为 true,说明i就是名人,返回即可,如果遍历完所有人没有找到名人,返回 -1,参见代码如下:

解法一:

bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
vector<bool> candidate(n, true);
for (int i = ; i < n; ++i) {
for (int j = ; j < n; ++j) {
if (candidate[i] && i != j) {
if (knows(i, j) || !knows(j, i)) {
candidate[i] = false;
break;
} else {
candidate[j] = false;
}
}
}
if (candidate[i]) return i;
}
return -;
}
};

我们其实可以不用一维数组来标记每个人的状态,对于不是名人的i,直接 break,继续检查下一个,但是由于没有标记后面的候选人的状态,所以有可能会重复调用一些 knows 函数,所以下面这种方法虽然省了空间,但是调用 knows 函数的次数可能会比上面的方法次数要多,参见代码如下:

解法二:

bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
for (int i = , j = ; i < n; ++i) {
for (j = ; j < n; ++j) {
if (i != j && (knows(i, j) || !knows(j, i))) break;
}
if (j == n) return i;
}
return -;
}
};

下面这种方法是网上比较流行的一种方法,设定候选人 res 为0,原理是先遍历一遍,对于遍历到的人i,若候选人 res 认识i,则将候选人 res 设为i,完成一遍遍历后,来检测候选人 res 是否真正是名人,如果判断不是名人,则返回 -1,如果并没有冲突,返回 res,参见代码如下:

解法三:

bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
int res = ;
for (int i = ; i < n; ++i) {
if (knows(res, i)) res = i;
}
for (int i = ; i < n; ++i) {
if (res != i && (knows(res, i) || !knows(i, res))) return -;
}
return res;
}
};

由热心网友 fgvlty 提醒,还可以进一步减少 API 的调用量,找候选者的方法跟上面相同,但是在验证的时候,分为两段,先验证候选者前面的所有人,若候选者认识任何人,或者任何人不认识候选者,直接返回 -1。再验证候选者后面的人,这时候只需要验证是否有人不认识候选者就可以了,因为在最开始找候选者的时候就已经保证了候选者不会认识后面的任何人,参见代码如下:

解法四:

bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
int res = ;
for (int i = ; i < n; ++i) {
if (knows(res, i)) res = i;
}
for (int i = ; i < res; ++i) {
if (knows(res, i) || !knows(i, res)) return -;
}
for (int i = res + ; i < n; ++i) {
if (!knows(i, res)) return -;
}
return res;
}
};

Github 同步地址:

https://github.com/grandyang/leetcode/issues/277

类似题目:

Find the Town Judge

参考资料:

https://leetcode.com/problems/find-the-celebrity/

https://leetcode.com/problems/find-the-celebrity/discuss/71227/Java-Solution.-Two-Pass

https://leetcode.com/problems/find-the-celebrity/discuss/71228/JavaPython-O(n)-calls-O(1)-space-easy-to-understand-solution

LeetCode All in One 题目讲解汇总(持续更新中...)

[LeetCode] 277. Find the Celebrity 寻找名人的更多相关文章

  1. [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 o ...

  2. [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 o ...

  3. 名人问题 算法解析与Python 实现 O(n) 复杂度 (以Leetcode 277. Find the Celebrity为例)

    1. 题目描述 Problem Description Leetcode 277. Find the Celebrity Suppose you are at a party with n peopl ...

  4. [LeetCode] Find the Celebrity 寻找名人

    Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist o ...

  5. 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 o ...

  6. [LeetCode#277] Find the Celebrity

    Problem: Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there ma ...

  7. Leetcode之二分法专题-287. 寻找重复数(Find the Duplicate Number)

    Leetcode之二分法专题-287. 寻找重复数(Find the Duplicate Number) 给定一个包含 n + 1 个整数的数组 nums,其数字都在 1 到 n 之间(包括 1 和  ...

  8. Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target)

    Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target) 给定一个只包含小写字母的有序数组letters  ...

  9. Leetcode之二分法专题-154. 寻找旋转排序数组中的最小值 II(Find Minimum in Rotated Sorted Array II)

    Leetcode之二分法专题-154. 寻找旋转排序数组中的最小值 II(Find Minimum in Rotated Sorted Array II) 假设按照升序排序的数组在预先未知的某个点上进 ...

随机推荐

  1. HTML+CSS基础 并集选择器

    并集选择器.a,.b

  2. 【测试方法】Web测试中bug定位基本方法

    知识总结:Web测试中bug定位基本方法 涉及知识点:测试方法 在web测试过程中,经常会遇到页面中内容或数据显示错误,甚至不显示,第一反应就是BUG,没错,确实是BUG.进一步了解这个BUG的问题出 ...

  3. Python字典(Dictionary)update()方法

    原文连接:https://www.runoob.com/python/att-dictionary-update.html Python字典(dictionary)update()函数把字典dict2 ...

  4. 修改 Oracle 数据库实例字符集

    Ø  简介 在 Oracle 中创建数据库实例后,就会有对应使用的编码字符集.当我们设置的字符集与操作系统或者其他软件字符集不一致时,就会出现个字符长度存储一个汉字. 2.   SIMPLIFIED ...

  5. Window权限维持(九):端口监视器

    后台打印程序服务负责管理Windows操作系统中的打印作业.与服务的交互通过打印后台处理程序API执行,该API包含一个函数(AddMonitor),可用于安装本地端口监视器并连接配置.数据和监视器文 ...

  6. Visual Studio中的主题定制变得更加容易

    有时Visual Studio的默认主题是不够的.幸运的是,我们刚刚重新设计了创建和导入自定义主题的过程. 导入主题的唯一方法之一是下载旧的Color Theme Editor扩展.如果你足够勇敢地创 ...

  7. 微信测试号:config:invalid url domain

    今天调试微信分享的时候,配置参数时一直提示config:invalid url domain,网上找了一下,都说是appId和域名没有绑定.仔细看了下,有绑定没错.又猜测是不是二级域名的问题,因为是测 ...

  8. PHP获得毫秒数

    因为前端需要写函数处理时间戳,比较麻烦,所以我们有的时候,需要接口传递毫秒数给前端. 下面可以通过这个函数来获得毫秒数 <?php function getMillisecond() { lis ...

  9. 手写instanceof (详解原型链) 和 实现绑定解绑和派发的事件类

    A  instanceof  B    是判断  A  是否继承自B,是返回true,  否返回false 再精确点就是判断B   是否  再  A  的 原型链上, 什么是原型链,举个例子: 我们定 ...

  10. Django的路由系统:URL

    一. URLconf配置 基本格式 from django.conf.urls import url urlpatterns = [ url(正则表达式, views视图,参数,别名), ] 参数说明 ...