Commit 1469905

author

hj.tian

committed

feat: add leetcode75/day27_322.py

1 parent 1de1f71 commit 1469905Copy full SHA for 1469905

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+from typing import List`
	`2`	`+`
	`3`	`+`
	`4`	`+class Solution:`
	`5`	`+ def coinChange(self, coins: List[int], amount: int) -> int:`
	`6`	`+ """`
	`7`	`+ dp[i]: 表示换成i金额所需要的最少硬币个数,则`
	`8`	`+ dp[i] = min(dp[i-coin] + 1 for coin in coins)`
	`9`	`+ """`
	`10`	`+ dp = [0 for _ in range(amount + 1)]`
	`11`	`+ dp[0] = 0`
	`12`	`+ for i in range(1, amount + 1):`
	`13`	`+ mins = amount + 1`
	`14`	`+ for coin in coins:`
	`15`	`+ if i >= coin:`
	`16`	`+ if dp[i - coin] + 1 < mins:`
	`17`	`+ mins = dp[i - coin] + 1`
	`18`	`+ dp[i] = mins`
	`19`	`+ if dp[amount] == amount + 1:`
	`20`	`+ return -1`
	`21`	`+ return dp[amount]`
	`22`	`+`
	`23`	`+`
	`24`	`+if __name__ == "__main__":`
	`25`	`+ assert Solution().coinChange(coins=[1, 2, 5], amount=11) == 3`
	`26`	`+ assert Solution().coinChange(coins=[2], amount=3) == -1`
	`27`	`+ assert Solution().coinChange(coins=[1], amount=0) == 0`
	`28`	`+ assert Solution().coinChange(coins=[2, 5, 10, 1], amount=27) == 4`
	`29`	`+ assert Solution().coinChange(coins=[2], amount=1) == -1`

Comments

(0)