Merge pull request #440 from fusunx/master

0509.斐波那契数列.md Javascript

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]
+};
+```
 
 
 -----------------------

problems/0343.整数拆分.md

@@ -225,7 +225,20 @@ class Solution:
 Go：
 
 
+Javascript:
+```Javascript
+var integerBreak = function(n) {
+    let dp = new Array(n + 1).fill(0)
+    dp[2] = 1
 
+    for(let i = 3; i <= n; i++) {
+        for(let j = 1; j < i; j++) {
+            dp[i] = Math.max(dp[i], dp[i - j] * j, (i - j) * j)
+        }
+    }
+    return dp[n]
+};
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)

problems/0509.斐波那契数.md

@@ -220,7 +220,17 @@ func fib(n int) int {
         return c
 }
 ```
-
+Javascript:
+```Javascript
+var fib = function(n) {
+    let dp = [0, 1]
+    for(let i = 2; i <= n; i++) {
+        dp[i] = dp[i - 1] + dp[i - 2]
+    }
+    console.log(dp)
+    return dp[n]
+};
+```