Leetcode 277. Find the Celebrity (Medium) (cpp)
2016-10-22 04:42
766 查看
Leetcode 277. Find the Celebrity (Medium) (cpp)
Tag: Array
Difficulty: Medium
/*
277. Find the Celebrity (Medium)
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.
*/
// Forward declaration of the knows API.
bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
int l = 0, r = n - 1;
while (l < r) {
if (knows(l, r)) {
l++;
} else {
r--;
}
}
for (int i = 0; i < n; i++) {
if (i == l || knows(i, l) && !knows(l, i)) {
continue;
} else {
return -1;
}
}
return l;
}
};
Tag: Array
Difficulty: Medium
/*
277. Find the Celebrity (Medium)
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.
*/
// Forward declaration of the knows API.
bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
int l = 0, r = n - 1;
while (l < r) {
if (knows(l, r)) {
l++;
} else {
r--;
}
}
for (int i = 0; i < n; i++) {
if (i == l || knows(i, l) && !knows(l, i)) {
continue;
} else {
return -1;
}
}
return l;
}
};
相关文章推荐
- Leetcode 156. Binary Tree Upside Down (Medium) (cpp)
- Leetcode 92. Reverse Linked List II (Medium) (cpp)
- Leetcode 279. Perfect Squares (Medium) (cpp)
- Leetcode 91. Decode Ways (Medium) (cpp)
- Leetcode 215. Kth Largest Element in an Array (Medium) (cpp)
- Leetcode 309. Best Time to Buy and Sell Stock with Cooldown (Medium) (cpp)
- Leetcode 384. Shuffle an Array (Medium) (cpp)
- Leetcode 31. Next Permutation (Medium) (cpp)
- Leetcode 11. Container With Most Water (Medium) (cpp)
- Leetcode 220. Contains Duplicate III (Medium) (cpp)
- Leetcode 255. Verify Preorder Sequence in Binary Search Tree (Medium) (cpp)
- Leetcode 147. Insertion Sort List (Medium) (cpp)
- Leetcode 233. Number of Digit One (Medium) (cpp)
- Leetcode 12. Integer to Roman (Medium) (cpp)
- Leetcode 338. Counting Bits (Medium) (cpp)
- Leetcode 357. Count Numbers with Unique Digits (Medium) (cpp)
- Leetcode 221. Maximal Square (Medium) (cpp)
- Leetcode 18. 4Sum (Medium) (cpp)
- Leetcode 95. Unique Binary Search Trees II (Medium) (cpp)
- Leetcode 289. Game of Life (Medium) (cpp)