Skip to content

Commit 1868c3f

and-starlabuladong

authored and

committed

Fix qing-wa-tiao-tai-jie-wen-ti-lcof

1 parent 97a8ad3 commit 1868c3fCopy full SHA for 1868c3f

File tree

1 file changed

+3

-3

lines changed

多语言解法代码
- solution_code.md

1 file changed

+3

-3

lines changed

`‎多语言解法代码/solution_code.md‎`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -50869,7 +50869,7 @@ var dp = function(n, memo) {`
`50869`	`50869`	`class Solution:`
`50870`	`50870`	`# 备忘录`
`50871`	`50871`	`memo = []`
`50872`		`-`
	`50872`	`+ MOD = 1e9 + 7`
`50873`	`50873`	`def numWays(self, n: int) -> int:`
`50874`	`50874`	`self.memo = [-1] * (n + 1)`
`50875`	`50875`	`return self.dp(n)`
`@@ -50878,15 +50878,15 @@ class Solution:`
`50878`	`50878`	`def dp(self, n: int) -> int:`
`50879`	`50879`	`# base case`
`50880`	`50880`	`if n <= 2:`
`50881`		`- return n`
	`50881`	`+ return n if n else 1`
`50882`	`50882`
`50883`	`50883`	`if self.memo[n] != -1:`
`50884`	`50884`	`return self.memo[n]`
`50885`	`50885`
`50886`	`50886`	`# 状态转移方程:`
`50887`	`50887`	`# 爬到第 n 级台阶的方法个数等于爬到 n - 1 的方法个数和爬到 n - 2 的方法个数之和。`
`50888`	`50888`	`self.memo[n] = self.dp(n - 1) + self.dp(n - 2)`
`50889`		`- return self.memo[n]`
	`50889`	`+ return round(self.memo[n] % self.MOD)`
`50890`	`50890`	```
`50891`	`50891`
`50892`	`50892`	`https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof 的多语言解法👆`

0 commit comments

Comments

(0)