All files / leetCode 0070.ts

1
2
3
4
5
6
7
8
9
10
11
12
13
 
3x
 
3x
 
6x
6x
6x
 
 
3x
 
 
export default function climbStairs(n: number): number {
  let dp = 1
 
  for (let i = 1, p = 0, q = 0; i <= n; ++i) {
    // dp[i] = dp[i - 2] + dp[i - 1]
    p = q
    q = dp
    dp = p + q
  }
 
  return dp
}