coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

62
leetcode-cn/problem (English)/硬币(English) [coin-lcci].html
View File

@@ -1,31 +1,31 @@
<p>Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), write code to calculate the number of ways of representing n cents.&nbsp;(The result may be large, so you should return it modulo 1000000007)</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 5
<strong> Output</strong>: 2
<strong> Explanation</strong>: There are two ways:
5=5
5=1+1+1+1+1
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: n = 10
<strong> Output</strong>: 4
<strong> Explanation</strong>: There are four ways:
10=10
10=5+5
10=5+1+1+1+1+1
10=1+1+1+1+1+1+1+1+1+1
</pre>
<p><strong>Notes: </strong></p>
<p>You can assume:</p>
<ul>
<li>0 &lt;= n&nbsp;&lt;= 1000000</li>
</ul>
<p>Given an infinite number of quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent), write code to calculate the number of ways of representing n cents.&nbsp;(The result may be large, so you should return it modulo 1000000007)</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 5
<strong> Output</strong>: 2
<strong> Explanation</strong>: There are two ways:
5=5
5=1+1+1+1+1
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: n = 10