알고리즘 문제/Binary Search

알고리즘 문제/Binary Search

Koko Eating Bananas - Python Solution [LeetCode Medium]

원문 Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour..

브라우저
'알고리즘 문제/Binary Search' 카테고리의 글 목록