René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"腾讯\u0026leetcode875：爱吃香蕉的珂珂","articleBody":"珂珂喜欢吃香蕉。这里有 `N` 堆香蕉，第 `i` 堆中有 `piles[i]` 根香蕉。警卫已经离开了，将在 `H` 小时后回来。\r\n\r\n珂珂可以决定她吃香蕉的速度 `K` （单位：根/小时）。每个小时，她将会选择一堆香蕉，从中吃掉 `K` 根。如果这堆香蕉少于 `K` 根，她将吃掉这堆的所有香蕉，然后这一小时内不会再吃更多的香蕉。  \r\n\r\n珂珂喜欢慢慢吃，但仍然想在警卫回来前吃掉所有的香蕉。\r\n\r\n返回她可以在 `H` 小时内吃掉所有香蕉的最小速度 `K`（K 为整数）。\r\n\r\n**示例 1：**\r\n\r\n```\r\n输入: piles = [3,6,7,11], H = 8\r\n输出: 4\r\n```\r\n\r\n**示例 2：**\r\n\r\n```js\r\n输入: piles = [30,11,23,4,20], H = 5\r\n输出: 30\r\n```\r\n\r\n**示例 3：**\r\n\r\n```js\r\n输入: piles = [30,11,23,4,20], H = 6\r\n输出: 23\r\n```\r\n\r\n\r\n**提示：**\r\n\r\n- `1 \u003c= piles.length \u003c= 10^4`\r\n- `piles.length \u003c= H \u003c= 10^9`\r\n- `1 \u003c= piles[i] \u003c= 10^9`\r\n\r\n附赠leetcode地址：[leetcode](https://leetcode-cn.com/problems/koko-eating-bananas/solution/ai-chi-xiang-jiao-de-ke-ke-by-user7746o/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-09-18T00:11:32.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":8},"url":"https://github.com/109/JavaScript-Algorithms/issues/109"}