Skip to content

Commit 3aae058

Browse files
committed
增加动态方法找硬币的方法
1 parent 6aa631f commit 3aae058

File tree

1 file changed

+11
-11
lines changed

1 file changed

+11
-11
lines changed

change_coin.md

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -59,14 +59,14 @@
5959

6060
以下方法,以动态方式,提供最小的硬币数量。避免了贪婪方法的问题。
6161

62-
def coinChange(centsNeeded, coinValues):
63-
minCoins = [[0 for j in range(centsNeeded + 1)] for i in range(len(coinValues))]
64-
minCoins[0] = range(centsNeeded + 1)
65-
66-
for i in range(1,len(coinValues)):
67-
for j in range(0, centsNeeded + 1):
68-
if j < coinValues[i]:
69-
minCoins[i][j] = minCoins[i-1][j]
70-
else:
71-
minCoins[i][j] = min(minCoins[i-1][j], 1 + minCoins[i][j-coinValues[i]])
72-
return minCoins[-1][-1]
62+
def coinChange(centsNeeded, coinValues):
63+
minCoins = [[0 for j in range(centsNeeded + 1)] for i in range(len(coinValues))]
64+
minCoins[0] = range(centsNeeded + 1)
65+
66+
for i in range(1,len(coinValues)):
67+
for j in range(0, centsNeeded + 1):
68+
if j < coinValues[i]:
69+
minCoins[i][j] = minCoins[i-1][j]
70+
else:
71+
minCoins[i][j] = min(minCoins[i-1][j], 1 + minCoins[i][j-coinValues[i]])
72+
return minCoins[-1][-1]

0 commit comments

Comments
 (0)