1228. Poor Pigs

最新推荐文章于 2020-01-03 13:56:58 发布

Vest-Lee

最新推荐文章于 2020-01-03 13:56:58 发布

阅读量193

点赞数

分类专栏：刷题

本文链接：https://blog.youkuaiyun.com/vestlee/article/details/80731889

版权

刷题专栏收录该内容

215 篇文章

订阅专栏

本文探讨了一个有趣的算法问题：如何利用最少数量的猪，在有限时间内找出唯一含有毒液的水桶。文章提供了一种解决方法，并给出相应的算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

 
  描述 
 
There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. They all look the same. If a pig drinks that poison it will die within 15 minutes. What is the minimum amount of pigs you need to figure out which bucket contains the poison within one hour.
Answer this question, and write an algorithm for the follow-up general case.

  您在真实的面试中是否遇到过这个题？   
 是 

 
  挑战 
 
If there are n buckets and a pig drinking poison will die within m minutes, how many pigs (x) you need to figure out the "poison" bucket within p minutes? There is exact one bucket with poison.

这道题十分有趣。。。有趣到让我就觉得这不是算法题，我开始不太能想通该怎么算，然后就查该怎么做。

看了一些解释的棒的博客：http://www.cnblogs.com/grandyang/p/7664088.html

才终于明白了怎么做，这个维度确实是很难理解。

class Solution {
public:
    /**
     * @param buckets: an integer
     * @param minutesToDie: an integer
     * @param minutesToTest: an integer
     * @return: how many pigs you need to figure out the "poison" bucket within p minutes 
     */
    int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
        // Write your code here
        return ceil(log(buckets) / log(minutesToTest / minutesToDie + 1));
    }
};