zoukankan      html  css  js  c++  java
  • 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.

    Analyse: Be aware that the celebrity shouldn't know any others and others should all know him.
    Runtime: 239ms
     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         for (int i = 0; i < n; i++) {
     8             bool celebrity = true;
     9             // check if he know other people
    10             for (int j = 0; j < n; j++) {
    11                 if (j == i) continue;
    12                 if (knows(i, j)) {
    13                     celebrity = false;
    14                     break;
    15                 }
    16             }
    17             if (celebrity) {
    18                 // check if all other people knows him
    19                 for (int k = 0; k < n; k++) {
    20                     if (k != i && !knows(k, i)) {
    21                         celebrity = false;
    22                         break;
    23                     }
    24                 }
    25             }
    26             if (celebrity) return i;
    27         }
    28         return -1;
    29     }
    30 };
     
  • 相关阅读:
    CVE-2017-11826:Office Open XML 标签嵌套解析混淆漏洞
    未授权访问漏洞总结
    Linux提权—脏牛漏洞(CVE-2016-5195)
    Linux提权
    (翻译)OpenDocument and Open XML security (OpenOffice.org and MS Office 2007)
    SSH后门万能密码
    Linux中使用gdb dump内存
    在 x64dbg 中设置条件断点和条件记录断点
    Linux中的.bash_ 文件详解
    Photoshop 第二课 工具-钢笔的使用
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5874205.html
Copyright © 2011-2022 走看看