Merge pull request youngyangyang04#2633 from nineninee/km0102

添加 卡码网0102.沉没孤岛 JS版

Author: youngyangyang04

problems/kamacoder/0102.沉没孤岛.md

@@ -146,6 +146,171 @@ int main() {
 
 ### 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 // 地图大小
+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))
+
+  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 {*} x 开始搜索节点的下标
+ * @param {*} y 开始搜索节点的下标
+ * @return {*}
+ */
+const dfs = (graph, x, y) => {
+  if (graph[x][y] !== 1) return
+  graph[x][y] = 2 // 标记为非孤岛陆地
+
+  for (let i = 0; i < 4; i++) {
+    let nextx = x + dir[i][0]
+    let nexty = y + dir[i][1]
+    if (nextx < 0 || nextx >= N || nexty < 0 || nexty >= M) continue
+    dfs(graph, nextx, nexty)
+  }
+}
+
+(async function () {
+
+  // 读取输入，初始化地图
+  await initGraph()
+
+  // 遍历地图左右两边
+  for (let i = 0; i < N; i++) {
+    if (graph[i][0] === 1) dfs(graph, i, 0)
+    if (graph[i][M - 1] === 1) dfs(graph, i, M - 1)
+  }
+
+  // 遍历地图上下两边
+  for (let j = 0; j < M; j++) {
+    if (graph[0][j] === 1) dfs(graph, 0, j)
+    if (graph[N - 1][j] === 1) dfs(graph, N - 1, j)
+  }
+
+
+  // 遍历地图，将孤岛沉没，即将陆地1标记为0；将非孤岛陆地2标记为1
+  for (let i = 0; i < N; i++) {
+    for (let j = 0; j < M; j++) {
+      if (graph[i][j] === 1) graph[i][j] = 0
+      else if (graph[i][j] === 2) graph[i][j] = 1
+    }
+    console.log(graph[i].join(' '));
+  }
+})()
+```
+
+
+
+#### 广搜版
+
+```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 // 地图大小
+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))
+
+  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 {*} x 开始搜索节点的下标
+ * @param {*} y 开始搜索节点的下标
+ * @return {*}
+ */
+const bfs = (graph, x, y) => {
+  let queue = []
+  queue.push([x, y])
+  graph[x][y] = 2 // 标记为非孤岛陆地
+
+  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 (graph[nextx][nexty] === 1) bfs(graph, nextx, nexty)
+    }
+  }
+}
+
+(async function () {
+
+  // 读取输入，初始化地图
+  await initGraph()
+
+  // 遍历地图左右两边
+  for (let i = 0; i < N; i++) {
+    if (graph[i][0] === 1) bfs(graph, i, 0)
+    if (graph[i][M - 1] === 1) bfs(graph, i, M - 1)
+  }
+
+  // 遍历地图上下两边
+  for (let j = 0; j < M; j++) {
+    if (graph[0][j] === 1) bfs(graph, 0, j)
+    if (graph[N - 1][j] === 1) bfs(graph, N - 1, j)
+  }
+
+
+  // 遍历地图，将孤岛沉没，即将陆地1标记为0；将非孤岛陆地2标记为1
+  for (let i = 0; i < N; i++) {
+    for (let j = 0; j < M; j++) {
+      if (graph[i][j] === 1) graph[i][j] = 0
+      else if (graph[i][j] === 2) graph[i][j] = 1
+    }
+    console.log(graph[i].join(' '));
+  }
+})()
+```
+
+
+
 ### TypeScript
 
 ### PhP