【LeetCode】277.Find the Celebrity(Medium)解题报告(带锁题)
2018-02-20 17:42
691 查看
【LeetCode】277.Find the Celebrity(Medium)解题报告(带锁题)
题目地址:https://leetcode.com/problems/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.
Solution:
Date:2018年2月20日
题目地址:https://leetcode.com/problems/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.
Solution:
time : O(n) space : O(1) */ class Solution { public int findCelebrity(int n) { if(n<2) return -1; int possible = 0; for(int i=1 ; i<n ;i++){ if(knows(possible,i)){ possible = i; } } //验证possible是名人 for(int i=0 ; i<n ;i++){ if(possible!=i && ((knows(possible,i) || !knows(i,possible)){ return -1; } } return possible; } }
Date:2018年2月20日
相关文章推荐
- 【LeetCode】75.Sort Colors(Medium)解题报告
- 【LeetCode】103. Binary Tree Zigzag Level Order Traversal(Medium)解题报告
- 【LeetCode】199.Binary Tree Right Side View(Medium)解题报告
- LeetCode解题报告 452. Minimum Number of Arrows to Burst Balloons [medium]
- LeetCode解题报告 413. Arithmetic Slices [medium]
- 【LeetCode】238.Product of Array Except Self(Medium)解题报告
- 【LeetCode】449.Serialize and Deserialize BST(Medium)解题报告
- 【LeetCode】275.H-Index II(Medium)解题报告
- 【LeetCode】280.Wiggle Sort (Medium)(带锁题)解题报告
- 【LeetCode】351.Android Unlock Patterns(Medium)解题报告
- 【LeetCode】60.Permutation Sequence(medium)解题报告
- 【LeetCode】94.Binary Tree Inorder Traversal(Medium)解题报告
- LeetCode解题报告 392. Is Subsequence [medium]
- LeetCode解题报告 309. Best Time to Buy and Sell Stock with Cooldown[medium]
- 【LeetCode】96.Unique Binary Search Trees(Medium)解题报告
- LeetCode解题报告 122. Best Time to Buy and Sell Stock II [medium]
- 【LeetCode】57.Insert Interval(Medium)解题报告
- 【LeetCode】334.Increasing Triplet Subsequence(Medium)解题报告
- 【LeetCode】406.Queue Reconstruction by Height(Medium)解题报告
- LeetCode解题报告 394. Decode String [medium]