From 6141fc92bb04dc9f09402b77341562efb8b952d7 Mon Sep 17 00:00:00 2001
From: han
From 9d32bab764755465017422aadab557c612e604e3 Mon Sep 17 00:00:00 2001
From: jinjjm <1185838762@qq.com>
Date: Thu, 31 Aug 2023 22:14:16 +0800
Subject: [PATCH 5/5] =?UTF-8?q?js=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
problems/0200.岛屿数量.广搜版.md | 36 +++++++++++++++++++++++
problems/0200.岛屿数量.深搜版.md | 33 +++++++++++++++++++++
problems/0695.岛屿的最大面积.md | 38 +++++++++++++++++++++++++
problems/0797.所有可能的路径.md | 22 ++++++++++++++
4 files changed, 129 insertions(+)
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
+};
+```
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
+};
+```