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

细读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 = 0wh_condition = nwhile wh_condition > 0:count += 1wh_condition -= countreturn 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

Leetcode 1884. Egg Drop With 2 Eggs and N Floors [Python]相关推荐

【LeetCode】222. Count Complete Tree Nodes 解题报告（Python）
[LeetCode]222. Count Complete Tree Nodes 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个 ...
LeetCode 887. Super Egg Drop
题目链接:https://leetcode.com/problems/super-egg-drop/ 题意:给你K个鸡蛋以及一栋N层楼的建筑,已知存在某一个楼层F(0<=F<=N),在不高 ...
Coursera Algorithms week1 算法分析练习测验: Egg drop 扔鸡蛋问题
题目原文: Suppose that you have an n-story building (with floors 1 through n) and plenty of eggs. An egg ...
【数据结构与算法】动态规划-leetcode.1884 鸡蛋掉落两枚鸡蛋
[题目]: 给你 2 枚相同的鸡蛋,和一栋从第 1 层到第 n 层共有 n 层楼的建筑. 已知存在楼层 f ,满足 0 <= f <= n ,任何从高于 f 的楼层落下的鸡蛋都会碎 ...
LeetCode 221. Maximal Square----动态规划--谷歌面试算法题--Python解法
题目地址:Maximal Square - LeetCode Given a 2D binary matrix filled with 0's and 1's, find the largest sq ...
LeetCode 445. Add Two Numbers II--面试算法题--C++,Python解法
题目地址:Add Two Numbers II - LeetCode You are given two non-empty linked lists representing two non-neg ...
LeetCode 17. Letter Combinations of a Phone Number--笔试题--C++,Python解法
题目地址:Letter Combinations of a Phone Number - LeetCode Given a string containing digits from 2-9 incl ...
LeetCode 746. Min Cost Climbing Stairs--动态规划--Java,C++,Python解法
题目地址:Min Cost Climbing Stairs - LeetCode LeetCode 动态规划(Dynamic programming)系列题目:LeetCode 动态规划(Dynami ...
LeetCode 121. Best Time to Buy and Sell Stock--Java，Python，C++解法
题目地址:Best Time to Buy and Sell Stock - LeetCode Say you have an array for which the ith element is t ...

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

Leetcode 1884. Egg Drop With 2 Eggs and N Floors [Python]相关推荐

最新文章

热门文章