diff --git a/problems/0718.最长重复子数组.md b/problems/0718.最长重复子数组.md
index 9ee94a3d..959ed39e 100644
--- a/problems/0718.最长重复子数组.md
+++ b/problems/0718.最长重复子数组.md
@@ -252,6 +252,33 @@ func findLength(A []int, B []int) int {
 }
 ```
 
+JavaScript：
+
+> 动态规划
+
+```javascript
+const findLength = (A, B) => {
+    // A、B数组的长度
+    const [m, n] = [A.length, B.length];
+    // dp数组初始化，都初始化为0
+    const dp = new Array(m + 1).fill(0).map(x => new Array(n + 1).fill(0));
+    // 初始化最大长度为0
+    let res = 0;
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            // 遇到A[i - 1] === B[j - 1]，则更新dp数组
+            if (A[i - 1] === B[j - 1]) {
+                dp[i][j] = dp[i - 1][j - 1] + 1;
+            }
+            // 更新res
+            res = dp[i][j] > res ? dp[i][j] : res;
+        }
+    }
+    // 遍历完成，返回res
+    return res;
+};
+```
+
 
 
 -----------------------