mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
33
算法题(国内版)/problem (Chinese)/硬币 [coin-lcci].html
Normal file
33
算法题(国内版)/problem (Chinese)/硬币 [coin-lcci].html
Normal file
@@ -0,0 +1,33 @@
|
||||
<p>硬币。给定数量不限的硬币,币值为25分、10分、5分和1分,编写代码计算n分有几种表示法。(结果可能会很大,你需要将结果模上1000000007)</p>
|
||||
|
||||
<p> <strong>示例1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>: n = 5
|
||||
<strong> 输出</strong>:2
|
||||
<strong> 解释</strong>: 有两种方式可以凑成总金额:
|
||||
5=5
|
||||
5=1+1+1+1+1
|
||||
</pre>
|
||||
|
||||
<p> <strong>示例2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>: n = 10
|
||||
<strong> 输出</strong>:4
|
||||
<strong> 解释</strong>: 有四种方式可以凑成总金额:
|
||||
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>说明:</strong></p>
|
||||
|
||||
<p>注意:</p>
|
||||
|
||||
<p>你可以假设:</p>
|
||||
|
||||
<ul>
|
||||
<li>0 <= n (总金额) <= 1000000</li>
|
||||
</ul>
|
Reference in New Issue
Block a user