mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Merge pull request #2427 from nullptr-z/master
Update: 70. 爬楼梯进阶版,增加 go 语言题解
This commit is contained in:
@ -169,7 +169,32 @@ class climbStairs{
|
||||
|
||||
|
||||
### Go:
|
||||
```go
|
||||
func climbStairs(n int, m int) int {
|
||||
dp := make([]int, n+1)
|
||||
dp[0] = 1
|
||||
for i := 1; i <= n; i++ {
|
||||
for j := 1; j <= m; j++ {
|
||||
if i-j >= 0 {
|
||||
dp[i] += dp[i-j]
|
||||
}
|
||||
}
|
||||
}
|
||||
return dp[n]
|
||||
}
|
||||
|
||||
func main() {
|
||||
// 读取输入n,m
|
||||
reader := bufio.NewReader(os.Stdin)
|
||||
input, _ := reader.ReadString('\n')
|
||||
input = strings.TrimSpace(input)
|
||||
nv := strings.Split(input, " ")
|
||||
n, _ := strconv.Atoi(nv[0])
|
||||
m, _ := strconv.Atoi(nv[1])
|
||||
result := climbStairs(n, m)
|
||||
fmt.Println(result)
|
||||
}
|
||||
```
|
||||
|
||||
### JavaScript:
|
||||
|
||||
|
Reference in New Issue
Block a user