竞争性编程简单

硬币找零问题

“硬币找零问题”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 count_coin_change(coins, n),返回使用无限供应的给定硬币面额 coins 为目标金额 n 进行找零的不同方式的数量。

约束条件
  • 1 <= len(coins) <= 100
  • 1 <= coins[i] <= 1000
  • 1 <= n <= 1000

示例

Example 1
Input
count_coin_change([1, 2, 3], 4)
Output
4
Explanation

There are 4 ways: {1,1,1,1}, {1,1,2}, {2,2}, {1,3}.

Example 2
Input
count_coin_change([2, 5, 3, 6], 10)
Output
5
Explanation

There are 5 ways: {2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5}, {5,5}.

Need a Hint?
考虑使用动态编程特定的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。