Leetcoed 277Find the Celebrity
来源:互联网 发布:ios邪恶软件 编辑:程序博客网 时间:2024/06/13 03:55
Find the Celebrity
Suppose you are at a party with n
people (labeled from 0
ton - 1
) and among them, there may exist one celebrity. The definition of a celebrity is that all the othern - 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 functionint findCelebrity(n)
, your function should minimize the number of calls toknows
.
转自
http://blog.csdn.net/xudli/article/details/48749295
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
.
[思路]
当 a -> b时, 可以推出, a不可能是celebrity, b被人知道的数目+1... 用bitmap记录.
/* The knows API is defined in the parent class Relation. boolean knows(int a, int b); */public class Solution extends Relation { public int findCelebrity(int n) { int[] bitmap = new int[n]; for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { if(i==j) continue; if(bitmap[j]>=0) { if( knows(i, j) ) { bitmap[i] = -1; bitmap[j]++; } else { bitmap[j] = -1; } } } } for(int i=0; i<n; i++) { if(bitmap[i] == n-1) { for(int j=0; j<n; j++) { if(i==j) continue; if(knows(i, j)) return -1; } return i; } } return -1; }}
- Leetcoed 277Find the Celebrity
- leetcode 277: Find the Celebrity
- [leetcode 277]Find the Celebrity---------找名人
- Medium 277题 Find the Celebrity
- 1st round, 277 Find the Celebrity
- Leetcode: Find the Celebrity
- *LeetCode-Find the Celebrity
- [LeetCode277]Find the Celebrity
- Find the Celebrity
- Leetcode Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- leetcode Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- 277. Find the Celebrity
- 277. Find the Celebrity
- navicat 10.1.7 注册码
- appledoc文档生成工具
- Java操作Excel JAVA EXCEL API
- total command 指南
- 快速掌握Lua 5.3 —— "metatables" and "metamethods" (1)
- Leetcoed 277Find the Celebrity
- 解决mac下Android环境搭建不成功或成功后总是报各种错误
- HttpClient中头部Header用法
- 编译VTK时Qt5_DIR-NOTFOUND的解决方法
- Java中的自动装箱与拆箱
- Unity导出IOS的坑1
- 在Linux下的进程资源的限制(struct rlimit)详解
- 聚类算法——K-means, K-means++, KNN, GMM,
- LeetCode 练习题解(152. Maximum Product Subarray)