mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-12-18 10:04:58 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>硬币。给定数量不限的硬币,币值为25分、10分、5分和1分,编写代码计算n分有几种表示法。(结果可能会很大,你需要将结果模上1000000007)</p>\n\n<p> <strong>示例1:</strong></p>\n\n<pre>\n<strong> 输入</strong>: n = 5\n<strong> 输出</strong>:2\n<strong> 解释</strong>: 有两种方式可以凑成总金额:\n5=5\n5=1+1+1+1+1\n</pre>\n\n<p> <strong>示例2:</strong></p>\n\n<pre>\n<strong> 输入</strong>: n = 10\n<strong> 输出</strong>:4\n<strong> 解释</strong>: 有四种方式可以凑成总金额:\n10=10\n10=5+5\n10=5+1+1+1+1+1\n10=1+1+1+1+1+1+1+1+1+1\n</pre>\n\n<p> <strong>说明:</strong></p>\n\n<p>注意:</p>\n\n<p>你可以假设:</p>\n\n<ul>\n<li>0 <= n (总金额) <= 1000000</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 243,
|
||||
"likes": 245,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"36.9K\", \"totalSubmission\": \"74.6K\", \"totalAcceptedRaw\": 36909, \"totalSubmissionRaw\": 74563, \"acRate\": \"49.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"37.6K\", \"totalSubmission\": \"76K\", \"totalAcceptedRaw\": 37592, \"totalSubmissionRaw\": 75965, \"acRate\": \"49.5%\"}",
|
||||
"hints": [
|
||||
"试着把它分解成子问题。如果你在做改变,第一选择是什么?",
|
||||
"如果你正在进行换零操作,不妨从决定需要多少个币值为25分的硬币开始。",
|
||||
|
||||
Reference in New Issue
Block a user