Commit 3a6d82d

authored

Create Solution.py

1 parent 12f5bb3 commit 3a6d82dCopy full SHA for 3a6d82d

File tree

+15

-0

lines changed

+15

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+class Solution:`
	`2`	`+ def minCostClimbingStairs(self, cost: List[int]) -> int:`
	`3`	`+ n = len(cost)`
	`4`	`+ dp = [None]*n`
	`5`	`+`
	`6`	`+ if n == 1:`
	`7`	`+ return cost[0]`
	`8`	`+`
	`9`	`+ dp[0] = cost[0]`
	`10`	`+ dp[1] = cost[1]`
	`11`	`+`
	`12`	`+ for i in range(2, n):`
	`13`	`+ dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i]`
	`14`	`+`
	`15`	`+ return min(dp[n - 2], dp[n - 1])`

Comments

(0)