0070.爬楼梯.md Javascript

Author: fusunx

problems/0070.爬楼梯.md

@@ -283,7 +283,18 @@ func climbStairs(n int) int {
     return dp[n]
 }
 ```
-
+Javascript:
+```Javascript
+var climbStairs = function(n) {
+    // dp[i] 为第 i 阶楼梯有多少种方法爬到楼顶
+    // dp[i] = dp[i - 1] + dp[i - 2]
+    let dp = [1 , 2]
+    for(let i = 2; i < n; i++) {
+        dp[i] = dp[i - 1] + dp[i - 2]
+    }
+    return dp[n - 1]
+};
+```
 
 
 -----------------------