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

    Example

    Example1

    Input:
    2 // next n * (n - 1) lines 
    0 knows 1
    1 does not know 0
    Output: 1
    Explanation:
    Everyone knows 1,and 1 knows no one.

    Solution 1: O(N^2)
    public class Solution extends Relation {
        /**
         * @param n a party with n people
         * @return the celebrity's label or -1
         */
        public int findCelebrity(int n) {
            if (n == 1) {
                return 0;
            }
            
            for (int i = 0; i < n; i++) {
                for (int j = 0 ; j < n; j++) {
                    if (i == j) {
                        continue;
                    }
    
                    if (knows(i, j) || !knows(j, i)) {
                        break;
                    }
                    if (j == n - 1) {
                        return i;
                    }
                    if (i == n - 1 && j == n - 2) {
                        return i;
                    }
                }
    
            }
            return -1;
        }

    Solution 2: O(N)

        public int findCelebrity(int n) {
            int celebrity = 0;
            for (int i = 1; i < n; i++) {
                if (knows(celebrity, i)) {
                    celebrity = i;
                }
            }
            
            for (int i = 0; i < n; i++) {
                if (i != celebrity && (knows(celebrity, i) || !knows(i, celebrity))) {
                    return -1;
                }
            }
            return celebrity;
        }
  • 相关阅读:
    xml转义字符在mybatis动态sql中的使用
    jdbc类型与java类型
    aop日志(记录方法调用日志)
    mysql数据库关联查询【lert join】常见使用
    maven项目基本配置
    mapper文件的参数传入与获取
    idea新建项目出现push rejected如何解决
    快速从2个List集合中找出相同/不同元素
    Windows 环境下安装RocketMQ
    RabbitMQ java客户端集成 Spring 开发环境
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12501617.html
Copyright © 2011-2022 走看看