競賽程式設計簡單

硬幣找零問題

「硬幣找零問題」問題的詳細指南和 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 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。