mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 05:26:46 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>桌上有 <code>n</code> 堆力扣币,每堆的数量保存在数组 <code>coins</code> 中。我们每次可以选择任意一堆,拿走其中的一枚或者两枚,求拿完所有力扣币的最少次数。</p>\n\n<p><strong>示例 1:</strong></p>\n\n<blockquote>\n<p>输入:<code>[4,2,1]</code></p>\n\n<p>输出:<code>4</code></p>\n\n<p>解释:第一堆力扣币最少需要拿 2 次,第二堆最少需要拿 1 次,第三堆最少需要拿 1 次,总共 4 次即可拿完。</p>\n</blockquote>\n\n<p><strong>示例 2:</strong></p>\n\n<blockquote>\n<p>输入:<code>[2,3,10]</code></p>\n\n<p>输出:<code>8</code></p>\n</blockquote>\n\n<p><strong>限制:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 4</code></li>\n\t<li><code>1 <= coins[i] <= 10</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 42,
|
||||
"likes": 43,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -150,7 +150,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"48.2K\", \"totalSubmission\": \"57.4K\", \"totalAcceptedRaw\": 48181, \"totalSubmissionRaw\": 57414, \"acRate\": \"83.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"49.2K\", \"totalSubmission\": \"58.6K\", \"totalAcceptedRaw\": 49191, \"totalSubmissionRaw\": 58563, \"acRate\": \"84.0%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user