2014-03-20 01:08

題目：扔雞蛋問題。有一個雞蛋，如果從N樓扔下去恰好會摔碎，低于N樓則不碎，可以繼續扔。給你兩個這樣的雞蛋，要求你一定得求出N，怎么扔才能減少最壞情況下的扔的次數？

解法：為了讓worst case得到最優化，就需要讓best case和worst case最接近。具體做法請參見書上題解，因為我一直在想著二分，實在是摸不著頭腦。

代碼：

1 // 6.5 Given 100 floors and 2 eggs. 2 // If the egg can sustain a dropping from nth floor, and will break for higher drop, please find a way to determine n, and minimize the number of droppings. 3 // Answer: 4 // That's indeed a brain teaser with mathematical principle. 5 // It just doesn't make sense to me, why it is optimized when num_of_drop(egg1) + num_of_drop(egg2) always stays the same. 6 // Perhaps you should read the book yourself. I do hope that I don't face such a question. Quite a teaser, tease me more. 7 int main() 8 { 9 return 0; 10 }

?

轉載于:https://www.cnblogs.com/zhuli19901106/p/3612744.html

《新程序員》：云原生和全面數字化實踐50位技術專家共同創作，文字、視頻、音頻交互閱讀

總結

以上是生活随笔為你收集整理的《Cracking the Coding Interview》——第6章：智力题——题目5的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。