[leetcode]458. Poor Pigs

最新推荐文章于 2020-01-30 13:24:14 发布

Brett-Xu

最新推荐文章于 2020-01-30 13:24:14 发布

阅读量123

点赞数

分类专栏： LeetCode 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/weixin_41814716/article/details/86411379

版权

LeetCode 专栏收录该内容

102 篇文章 0 订阅

订阅专栏

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.

分析：

有n个外观一样的桶，其中一桶是毒药，其余是水，猪喝了毒药会在m分钟内死去，要求在p分钟内检测出有毒药的那一桶，问需要几头猪。如果p和m都为15，那么1头猪能测2桶；如果2头能测4桶，方法是让两头猪先各自喝一桶，再喝同一桶，剩下的一桶都不喝，便能根据猪的死亡情况判断哪桶装的是毒药；以此类推，3头猪能测8桶，即2的指数倍。如果时间p是m的2倍，可以推出j头猪能测出3的j次方桶，依次类推。

class Solution {
public:
    int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
        if(buckets == 1) 
            return 0;
        int res = 1;
        int base = minutesToTest/minutesToDie+1;
        for(int i = 1; ; i++)
        {
            res *= base;
            if(res >= buckets) 
               return i;
        }
        return 0;
    }
};