algorithm/fucking-algorithm
1
0
Fork 0
mirror of https://github.com/labuladong/fucking-algorithm.git synced 2025-07-06 12:33:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

高楼扔鸡蛋进阶修改了图片文件夹名，修改原版的对应路径

Browse Source
This commit is contained in:
labuladong
2020-03-04 09:32:26 +08:00
parent 3150914b04
commit 642f4618ac
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
dynamic_programming/Throwing Eggs in High Buildings.md
View File

@ -77,7 +77,7 @@ After we choose to throw a egg on the `i`-th floor, two situations could happen:
**If the egg is not broken**, then the number of eggs `K` will not change, and the searched floor interval should be changed from`[1..N]`to`[i+1..N]`,`N-i` floors in total. **If the egg is not broken**, then the number of eggs `K` will not change, and the searched floor interval should be changed from`[1..N]`to`[i+1..N]`,`N-i` floors in total.
![](../pictures/扔鸡蛋/1.jpg) ![](../pictures/SuperEggDrop/1.jpg)
PS: Attentive readers may ask, if throwing a egg on the i-th floor is not broken, the search range of the floor is narrowed down to the upper floors, should it include the i-th floor? No, because it is included. As I said at the beginning that F can be equal to 0, after recursing upwards, the i-th floor is actually equivalent to the 0th floor, so there is nothing wrong. PS: Attentive readers may ask, if throwing a egg on the i-th floor is not broken, the search range of the floor is narrowed down to the upper floors, should it include the i-th floor? No, because it is included. As I said at the beginning that F can be equal to 0, after recursing upwards, the i-th floor is actually equivalent to the 0th floor, so there is nothing wrong.