Leetcode 1884. Egg Drop With 2 Eggs and N Floors [Python]

Case_CaiNiao

于 2022-02-03 17:46:06 发布

阅读量247

点赞数

分类专栏： Leetcode学习记录文章标签： leetcode python 算法

本文链接：https://blog.csdn.net/sinat_30403031/article/details/122777372

版权

Leetcode学习记录专栏收录该内容

268 篇文章 1 订阅

订阅专栏

细读example 2:
One optimal strategy is:

Drop the 1st egg at floor 9. If it breaks, we know f is between 0 and 8. Drop the 2nd egg starting from floor 1 and going up one at a time to find f within 8 more drops. Total drops is 1 + 8 = 9.
If the 1st egg does not break, drop the 1st egg again at floor 22. If it breaks, we know f is between 9 and 21. Drop the 2nd egg starting from floor 10 and going up one at a time to find f within 12 more drops. Total drops is 2 + 12 = 14.
If the 1st egg does not break again, follow a similar process dropping the 1st egg from floors 34, 45, 55, 64, 72, 79, 85, 90, 94, 97, 99, and 100.
Regardless of the outcome, it takes at most 14 drops to determine f.

class Solution:
    def twoEggDrop(self, n: int) -> int:
        count = 0
        wh_condition = n
        while wh_condition > 0:
            count += 1
            wh_condition -= count
        return count
    
#dropAtFloors = [9,22,34,45,55,64,72,79,85,90,94,97,99,100]
#(gap)		   8 13 12 11 10 9  8  7  6  5  4  3  2  1