diff --git a/problems/0116.填充每个节点的下一个右侧节点指针.md b/problems/0116.填充每个节点的下一个右侧节点指针.md
index 28e6f645..6feb1ca9 100644
--- a/problems/0116.填充每个节点的下一个右侧节点指针.md
+++ b/problems/0116.填充每个节点的下一个右侧节点指针.md
@@ -130,21 +130,47 @@ public:
 ## Java
 
 ```java
+
 ```
 
 ## Python
 
 ```python
+
 ```
 
 ## Go
 
 ```go
+
 ```
 
 ## JavaScript
 
 ```js
+const connect = root => {
+    if (!root) return root;
+    // 根节点入队
+    const Q = [root];
+    while (Q.length) {
+        const len = Q.length;
+        // 遍历这一层的所有节点
+        for (let i = 0; i < len; i++) {
+            // 队头出队
+            const node = Q.shift();
+            // 连接
+            if (i < len - 1) {
+                // 新的队头是node的右边元素
+                node.next = Q[0];
+            }
+            // 队头左节点有值，放入队列
+            node.left && Q.push(node.left);
+            // 队头右节点有值，放入队列
+            node.right && Q.push(node.right);
+        }
+    }
+    return root;
+};
 ```
 
 -----------------------
diff --git a/problems/0123.买卖股票的最佳时机III.md b/problems/0123.买卖股票的最佳时机III.md
index 7ff1bfe2..c7193bbc 100644
--- a/problems/0123.买卖股票的最佳时机III.md
+++ b/problems/0123.买卖股票的最佳时机III.md
@@ -278,7 +278,44 @@ class Solution:
         return dp[4]
 ```
 
-Go：
+JavaScript：
+
+> 版本一：
+
+```javascript
+const maxProfit = prices => {
+    const len = prices.length;
+    const dp = new Array(len).fill(0).map(x => new Array(5).fill(0));
+    dp[0][1] = -prices[0];
+    dp[0][3] = -prices[0];
+    for (let i = 1; i < len; i++) {
+        dp[i][0] = dp[i - 1][0];
+        dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
+        dp[i][2] = Math.max(dp[i - 1][2], dp[i - 1][1] + prices[i]);
+        dp[i][3] = Math.max(dp[i - 1][3], dp[i - 1][2] - prices[i]);
+        dp[i][4] = Math.max(dp[i - 1][4], dp[i - 1][3] + prices[i]);
+    }
+    return dp[len - 1][4];
+};
+```
+
+> 版本二：
+
+```javascript
+const maxProfit = prices => {
+    const len = prices.length;
+    const dp = new Array(5).fill(0);
+    dp[1] = -prices[0];
+    dp[3] = -prices[0];
+    for (let i = 1; i < len; i++) {
+        dp[1] = Math.max(dp[1], dp[0] - prices[i]);
+        dp[2] = Math.max(dp[2], dp[1] + prices[i]);
+        dp[3] = Math.max(dp[3], dp[2] - prices[i]);
+        dp[4] = Math.max(dp[4], dp[3] + prices[i]);
+    }
+    return dp[4];
+};
+```