b***k
发帖数: 2673 | 2 ☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 21:01:08 2009, 美东) 提到:
question from an i-bank
suppose there are k denominations in a coin system, denoted as d_1, ..., d_k
. give me an efficient algorithm that makes an amount of n using as few
coins as possible.
☆─────────────────────────────────────☆
swordmans (风云第一刀) 于 (Fri Jun 19 21:59:47 2009, 美东) 提到:
Dynamics programming, and for some special cases, Greey method may work
_k
☆──────────────────────────────── |
|
