diff --git a/problems/0200.岛屿数量.广搜版.md b/problems/0200.岛屿数量.广搜版.md
index 5b9d90aa..5acdf6e2 100644
--- a/problems/0200.岛屿数量.广搜版.md
+++ b/problems/0200.岛屿数量.广搜版.md
@@ -239,6 +239,42 @@ class Solution:
                 visited[next_i][next_j] = True
 
 ```
+### JavaScript
+```javascript
+var numIslands = function (grid) {
+    let dir = [[0, 1], [1, 0], [-1, 0], [0, -1]]; // 四个方向
+    let bfs = (grid, visited, x, y) => {
+        let queue = [];
+        queue.push([x, y]);
+        visited[x][y] = true;
+        while (queue.length) {
+            let top = queue.shift();//取出队列头部元素
+            console.log(top)
+            for (let i = 0; i < 4; i++) {
+                let nextX = top[0] + dir[i][0]
+                let nextY = top[1] + dir[i][1]
+                if (nextX < 0 || nextX >= grid.length || nextY < 0 || nextY >= grid[0].length)
+                    continue;
+                if (!visited[nextX][nextY] && grid[nextX][nextY] === "1") {
+                    queue.push([nextX, nextY])
+                    visited[nextX][nextY] = true
+                }
+            }
+        }
+    }
+    let visited = new Array(grid.length).fill().map(() => Array(grid[0].length).fill(false))
+    let res = 0
+    for (let i = 0; i < grid.length; i++) {
+        for (let j = 0; j < grid[i].length; j++) {
+            if (!visited[i][j] && grid[i][j] === "1") {
+                ++res;
+                bfs(grid, visited, i, j);
+            }
+        }
+    }
+    return res
+};
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
diff --git a/problems/0200.岛屿数量.深搜版.md b/problems/0200.岛屿数量.深搜版.md
index f610e323..b8f2c992 100644
--- a/problems/0200.岛屿数量.深搜版.md
+++ b/problems/0200.岛屿数量.深搜版.md
@@ -278,6 +278,39 @@ class Solution:
 
         return result
 ```
+### JavaScript
+
+```javascript
+var numIslands = function (grid) {
+    let dir = [[0, 1], [1, 0], [-1, 0], [0, -1]]; // 四个方向
+
+    let dfs = (grid, visited, x, y) => {
+        for (let i = 0; i < 4; i++) {
+            let nextX = x + dir[i][0]
+            let nextY = y + dir[i][1]
+            if (nextX < 0 || nextX >= grid.length || nextY < 0 || nextY >= grid[0].length)
+                continue;
+            if (!visited[nextX][nextY] && grid[nextX][nextY] === "1") {
+                visited[nextX][nextY] = true
+                dfs(grid,visited,nextX,nextY)
+            }
+        }
+    }
+    let visited = new Array(grid.length).fill().map(() => Array(grid[0].length).fill(false))
+
+    let res = 0
+    for (let i = 0; i < grid.length; i++) {
+        for (let j = 0; j < grid[i].length; j++) {
+            if (!visited[i][j] && grid[i][j] === "1") {
+                ++res;
+                visited[i][j] = true;
+                dfs(grid, visited, i, j);
+            }
+        }
+    }
+    return res
+};
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
diff --git a/problems/0695.岛屿的最大面积.md b/problems/0695.岛屿的最大面积.md
index 186f044c..894f3a75 100644
--- a/problems/0695.岛屿的最大面积.md
+++ b/problems/0695.岛屿的最大面积.md
@@ -390,6 +390,44 @@ class Solution:
             if 0 <= new_x < len(grid) and 0 <= new_y < len(grid[0]): 
                 self.dfs(grid, visited, new_x, new_y)
 ```
+### JavaScript
+```javascript
+var maxAreaOfIsland = function (grid) {
+    let dir = [[0, 1], [1, 0], [-1, 0], [0, -1]]; // 四个方向
+    
+    let visited = new Array(grid.length).fill().map(() => Array(grid[0].length).fill(false))
+    
+    let dfs = (grid, visited, x, y, m) => {
+        for (let i = 0; i < 4; i++) {
+            let nextX = x + dir[i][0]
+            let nextY = y + dir[i][1]
+            if (nextX < 0 || nextX >= grid.length || nextY < 0 || nextY >= grid[0].length)
+                continue;
+            if (!visited[nextX][nextY] && grid[nextX][nextY] === 1) {
+                visited[nextX][nextY] = true
+                m = dfs(grid, visited, nextX, nextY,m+1)
+            }
+        }
+        return m
+    }
+
+    let  max = 0
+
+    for (let i = 0; i < grid.length; i++) {
+        for (let j = 0; j < grid[i].length; j++) {
+            if (!visited[i][j] && grid[i][j] === 1) {
+                // 深度优先
+                visited[i][j] = true;
+                let m = dfs(grid, visited, i, j, 1);
+                if (m > max) max = m;
+            }
+        }
+    }
+    return max
+};
+```
+
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
diff --git a/problems/0797.所有可能的路径.md b/problems/0797.所有可能的路径.md
index ec8288c6..6b47c42e 100644
--- a/problems/0797.所有可能的路径.md
+++ b/problems/0797.所有可能的路径.md
@@ -217,6 +217,28 @@ class Solution:
             self.path.pop() # 回溯
 ```
 
+### JavaScript
+```javascript
+var allPathsSourceTarget = function(graph) {
+    let res=[],path=[]
+
+    function dfs(graph,start){
+        if(start===graph.length-1){
+            res.push([...path])
+            return;
+        }
+        for(let i=0;i<graph[start].length;i++){
+            path.push(graph[start][i])
+            dfs(graph,graph[start][i])
+            path.pop()
+        }
+    }
+    path.push(0)
+    dfs(graph,0)
+    return res
+};
+```
+
 
 
 <p align="center">