From 449099e2963f1522efed65378530596e1ad422a7 Mon Sep 17 00:00:00 2001
From: wangya <1264178545@qq.com>
Date: Wed, 17 Jul 2024 14:24:30 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20=E5=8D=A1=E7=A0=81?=
 =?UTF-8?q?=E7=BD=910100.=E5=B2=9B=E5=B1=BF=E7=9A=84=E6=9C=80=E5=A4=A7?=
 =?UTF-8?q?=E9=9D=A2=E7=A7=AF=20JS=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../kamacoder/0100.岛屿的最大面积.md   | 90 +++++++++++++++++++
 1 file changed, 90 insertions(+)

diff --git a/problems/kamacoder/0100.岛屿的最大面积.md b/problems/kamacoder/0100.岛屿的最大面积.md
index 19292be7..43e7e968 100644
--- a/problems/kamacoder/0100.岛屿的最大面积.md
+++ b/problems/kamacoder/0100.岛屿的最大面积.md
@@ -232,6 +232,96 @@ public:
 
 ### Javascript
 
+```javascript
+// 广搜版
+
+const r1 = require('readline').createInterface({ input: process.stdin });
+// 创建readline接口
+let iter = r1[Symbol.asyncIterator]();
+// 创建异步迭代器
+const readline = async () => (await iter.next()).value;
+
+let graph // 地图
+let N, M // 地图大小
+let visited // 访问过的节点
+let result = 0 // 最大岛屿面积
+let count = 0 // 岛屿内节点数
+const dir = [[0, 1], [1, 0], [0, -1], [-1, 0]] //方向
+
+
+// 读取输入，初始化地图
+const initGraph = async () => {
+  let line = await readline();
+  [N, M] = line.split(' ').map(Number);
+  graph = new Array(N).fill(0).map(() => new Array(M).fill(0))
+  visited = new Array(N).fill(false).map(() => new Array(M).fill(false))
+
+  for (let i = 0; i < N; i++) {
+    line = await readline()
+    line = line.split(' ').map(Number)
+    for (let j = 0; j < M; j++) {
+      graph[i][j] = line[j]
+    }
+  }
+}
+
+
+/**
+ * @description: 从(x, y)开始广度优先遍历
+ * @param {*} graph 地图
+ * @param {*} visited 访问过的节点
+ * @param {*} x 开始搜索节点的下标
+ * @param {*} y 开始搜索节点的下标
+ * @return {*}
+ */
+const bfs = (graph, visited, x, y) => {
+  let queue = []
+  queue.push([x, y])
+  count++
+  visited[x][y] = true  //只要加入队列就立刻标记为访问过
+
+  while (queue.length) {
+    let [xx, yy] = queue.shift()
+    for (let i = 0; i < 4; i++) {
+      let nextx = xx + dir[i][0]
+      let nexty = yy + dir[i][1]
+      if(nextx < 0 || nextx >= N || nexty < 0 || nexty >= M) continue
+      if(!visited[nextx][nexty] && graph[nextx][nexty] === 1){
+        queue.push([nextx, nexty])
+        count++
+        visited[nextx][nexty] = true
+      }
+    }
+  }
+
+}
+
+(async function () {
+
+  // 读取输入，初始化地图
+  await initGraph()
+
+  // 统计最大岛屿面积
+  for (let i = 0; i < N; i++) {
+    for (let j = 0; j < M; j++) {
+      if (!visited[i][j] && graph[i][j] === 1) { //遇到没有访问过的陆地
+        // 重新计算面积
+        count = 0
+
+        // 广度优先遍历，统计岛屿内节点数，并将岛屿标记为已访问
+        bfs(graph, visited, i, j)
+
+        // 更新最大岛屿面积
+        result = Math.max(result, count)
+      }
+    }
+  }
+  console.log(result);
+})()
+```
+
+
+
 ### TypeScript
 
 ### PhP