Commit 047c4db

authored

Merge pull request youngyangyang04#1271 from xiaofei-2020/dp04

添加(0746.使用最小花费爬楼梯.md):增加typescript版本

2 parents faeaaf4 + 25e26f1 commit 047c4dbCopy full SHA for 047c4db

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -266,7 +266,30 @@ var minCostClimbingStairs = function(cost) {`
`266`	`266`	`};`
`267`	`267`	```
`268`	`268`
	`269`	`+### TypeScript`
	`270`	`+`
	`271`	+```typescript
	`272`	`+function minCostClimbingStairs(cost: number[]): number {`
	`273`	`+ /**`
	`274`	`+ dp[i]: 走到第i阶需要花费的最少金钱`
	`275`	`+ dp[0]: cost[0];`
	`276`	`+ dp[1]: cost[1];`
	`277`	`+ ...`
	`278`	`+ dp[i]: min(dp[i - 1], dp[i - 2]) + cost[i];`
	`279`	`+ */`
	`280`	`+ const dp: number[] = [];`
	`281`	`+ const length: number = cost.length;`
	`282`	`+ dp[0] = cost[0];`
	`283`	`+ dp[1] = cost[1];`
	`284`	`+ for (let i = 2; i <= length; i++) {`
	`285`	`+ dp[i] = Math.min(dp[i - 1], dp[i - 2]) + cost[i];`
	`286`	`+ }`
	`287`	`+ return Math.min(dp[length - 1], dp[length - 2]);`
	`288`	`+};`
	`289`	+```
	`290`	`+`
`269`	`291`	`### C`
	`292`	`+`
`270`	`293`	```c
`271`	`294`	`int minCostClimbingStairs(int* cost, int costSize){`
`272`	`295`	`//开辟dp数组,大小为costSize`

Comments

(0)