摘要: 法国大选的关注度一直不低。不过，政知道（微信ID:upolitics）注意到，日本英文媒体《日本时报》将法国大选评价为“史上最脏”的总统大选。法国此次大选如何就成了“史上最脏”？来看看他们都干了什么事儿！ ... ... ... 幻灯播放查看原图 X您已经浏览完所有图片重新播放 下一图集
There is a building of n floors. If an egg drops from the k th floor or above, it will break. If it's dropped from any floor below, it will not break. You're given two eggs, Find k while minimize the number of drops for the worst case. Return the number of drops in the worst case.
For n = 10, a naive way to find k is drop egg from 1st floor, 2nd floor ... kth floor. But in this worst case (k = 10), you have to drop 10 times.
Notice that you have two eggs, so you can drop at 4th, 7th & 9th floor, in the worst case (for example, k = 9) you have to drop 4 times.