LeetCode 题解(263) : Find the Celebrity
来源:互联网 发布:淘宝怎么上一千零一夜 编辑:程序博客网 时间:2024/05/17 21:31
题目:
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
.
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 = 0 while i < n: j = i + 1 while j < n and not knows(i, j): j += 1 if j == n: break i = j for k in range(n): if k == i: continue if not knows(k, i) or knows(i, k): return -1 return i
- LeetCode 题解(263) : Find the Celebrity
- Leetcode: Find the Celebrity
- *LeetCode-Find the Celebrity
- Leetcode Find the Celebrity
- leetcode Find the Celebrity
- leetcode 277: Find the Celebrity
- LeetCode 277. Find the Celebrity
- Leetcode 277. Find the Celebrity
- LeetCode 277. Find the Celebrity
- [leetcode 277]Find the Celebrity---------找名人
- [leetcode] 277. Find the Celebrity 解题报告
- Leetcode 277. Find the Celebrity (Medium) (cpp)
- [Leetcode] 277. Find the Celebrity 解题报告
- [LeetCode277]Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- Find the Celebrity
- C++ string大小写转换
- (二)对象和类型
- "=="和"equal"的区别
- Laravel+apache 报 404
- sql server 2005 32位+64位、企业版+标准版、CD+DVD 下载地址大全
- LeetCode 题解(263) : Find the Celebrity
- win7(windows 7)系统下安装SQL2005(SQL Server 2005)图文教程
- Ember.js 入门指南——组件定义
- xcode插件 - 生成@3x图片对应的@2x和@1x版本--RTImageAssets
- [Leetcode] Find the Duplicate Number
- xcode插件 - 规范注释生成器VVDocumenter 以及 14个有用的插件
- ZOJ 3633Alice's present (脑洞题)
- LeetCode-Merge Intervals
- ubuntu 14.04 部署ssh samba