mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -9,10 +9,10 @@
|
||||
"titleSlug": "nZZqjQ",
|
||||
"content": "<p>English description is not available for the problem. Please switch to Chinese.</p>\n",
|
||||
"translatedTitle": "狒狒吃香蕉",
|
||||
"translatedContent": "<p>狒狒喜欢吃香蕉。这里有 <code>N</code> 堆香蕉,第 <code>i</code> 堆中有 <code>piles[i]</code> 根香蕉。警卫已经离开了,将在 <code>H</code> 小时后回来。</p>\n\n<p>狒狒可以决定她吃香蕉的速度 <code>K</code> (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 <code>K</code> 根。如果这堆香蕉少于 <code>K</code> 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉,下一个小时才会开始吃另一堆的香蕉。 </p>\n\n<p>狒狒喜欢慢慢吃,但仍然想在警卫回来前吃掉所有的香蕉。</p>\n\n<p>返回她可以在 <code>H</code> 小时内吃掉所有香蕉的最小速度 <code>K</code>(<code>K</code> 为整数)。</p>\n\n<p> </p>\n\n<ul>\n</ul>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入: </strong>piles = [3,6,7,11], H = 8\n<strong>输出: </strong>4\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入: </strong>piles = [30,11,23,4,20], H = 5\n<strong>输出: </strong>30\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入: </strong>piles = [30,11,23,4,20], H = 6\n<strong>输出: </strong>23\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= piles.length <= 10^4</code></li>\n\t<li><code>piles.length <= H <= 10^9</code></li>\n\t<li><code>1 <= piles[i] <= 10^9</code></li>\n</ul>\n\n<p> </p>\n\n<p><meta charset=\"UTF-8\" />注意:本题与主站 875 题相同: <a href=\"https://leetcode-cn.com/problems/koko-eating-bananas/\">https://leetcode-cn.com/problems/koko-eating-bananas/</a></p>\n",
|
||||
"translatedContent": "<p>狒狒喜欢吃香蕉。这里有 <code>n</code> 堆香蕉,第 <code>i</code> 堆中有 <code>piles[i]</code> 根香蕉。警卫已经离开了,将在 <code>h</code> 小时后回来。</p>\n\n<p>狒狒可以决定她吃香蕉的速度 <code>k</code> (单位:根/小时)。每个小时,她将会选择一堆香蕉,从中吃掉 <code>k</code> 根。如果这堆香蕉少于 <code>k</code> 根,她将吃掉这堆的所有香蕉,然后这一小时内不会再吃更多的香蕉,下一个小时才会开始吃另一堆的香蕉。 </p>\n\n<p>狒狒喜欢慢慢吃,但仍然想在警卫回来前吃掉所有的香蕉。</p>\n\n<p>返回她可以在 <code>h</code> 小时内吃掉所有香蕉的最小速度 <code>k</code>(<code>k</code> 为整数)。</p>\n\n<p> </p>\n\n<ul>\n</ul>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>piles = [3,6,7,11], h = 8\n<strong>输出:</strong>4\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>piles = [30,11,23,4,20], h = 5\n<strong>输出:</strong>30\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>piles = [30,11,23,4,20], h = 6\n<strong>输出:</strong>23\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= piles.length <= 10<sup>4</sup></code></li>\n\t<li><code>piles.length <= h <= 10<sup>9</sup></code></li>\n\t<li><code>1 <= piles[i] <= 10<sup>9</sup></code></li>\n</ul>\n\n<p> </p>\n\n<p><meta charset=\"UTF-8\" /><strong>注意:</strong>本题与主站 875 题相同: <a href=\"https://leetcode-cn.com/problems/koko-eating-bananas/\">https://leetcode-cn.com/problems/koko-eating-bananas/</a></p>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 23,
|
||||
"likes": 26,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -150,7 +150,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 7412, \"totalSubmissionRaw\": 14145, \"acRate\": \"52.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"16.9K\", \"totalAcceptedRaw\": 8875, \"totalSubmissionRaw\": 16875, \"acRate\": \"52.6%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
@@ -179,7 +179,7 @@
|
||||
"editorType": "CKEDITOR",
|
||||
"ugcQuestionId": null,
|
||||
"style": "LEETCODE",
|
||||
"exampleTestcases": "[3,6,7,11]\n8",
|
||||
"exampleTestcases": "[3,6,7,11]\n8\n[30,11,23,4,20]\n5\n[30,11,23,4,20]\n6",
|
||||
"__typename": "QuestionNode"
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user