Leetcode 277. Find the Celebrity (Medium) (cpp)

最新推荐文章于 2020-07-28 07:30:56 发布

Niko_Ke

最新推荐文章于 2020-07-28 07:30:56 发布

阅读量477

点赞数

分类专栏： Leetcode C++ C++ Leetcode Array 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52889807

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

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;
    }
};