LeetCode 458.Poor Pigs

毒桶寻踪：最少猪只测毒算法

最新推荐文章于 2024-07-14 17:45:58 发布

转载最新推荐文章于 2024-07-14 17:45:58 发布 · 330 阅读

文章标签：

#leetcode

LeetCode 专栏收录该内容

25 篇文章

订阅专栏

本文探讨了使用最少数量的猪来确定1000桶中哪一桶含有毒药的问题，并给出了一种算法解决方案。进一步讨论了在n桶的情况下，如何在限定时间内找出有毒桶的方法。

这一题感觉更像是数学题
题目要求如下

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.

Follow-up:

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.

自己的思维很局限，看到大神的解释不得不膜拜
https://discuss.leetcode.com/topic/67666/another-explanation-and-solution

解法很简单，如下

class Solution {
    public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
        int pigs=0;
        while(Math.pow(minutesToTest/minutesToDie+1,pigs)<buckets){
            pigs+=1;
        }
        return pigs;
    }
}