zoukankan      html  css  js  c++  java
  • [LeetCode] Find the Celebrity

    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 - 1people 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.

    双指针,O(n)时间,O(1)空间。

     1 // Forward declaration of the knows API.
     2 bool knows(int a, int b);
     3 
     4 class Solution {
     5 public:
     6     int findCelebrity(int n) {
     7         int l = 0, r = n - 1;
     8         while (l < r) {
     9             if (knows(l, r)) ++l;
    10             else --r;
    11         }
    12         for (int i = 0; i < n; ++i) if (i != l) {
    13             if (knows(l, i) || !knows(i, l)) return -1;
    14         }
    15         return l;
    16     }
    17 };
  • 相关阅读:
    算法
    Unity-UI
    lua-设计与实现 1类型
    Unity-Cache Server
    lua-高效编程-总结
    算法-JPS寻路设计思想
    数据结构- List、Dictionary
    数据结构-二叉树、堆
    VSCode更好用
    功能快捷键
  • 原文地址:https://www.cnblogs.com/easonliu/p/4785253.html
Copyright © 2011-2022 走看看