From 612ff79f4f2e1efe60511f52d27d510e9eb417fe Mon Sep 17 00:00:00 2001
From: kimoge <1579457263@qq.com>
Date: Fri, 19 Jul 2024 10:41:04 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E5=8D=A1=E7=A0=8199=5F?=
 =?UTF-8?q?=E5=A2=9E=E5=8A=A0Python3=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../kamacoder/0099.岛屿的数量广搜.md   | 50 +++++++++++++++++++
 1 file changed, 50 insertions(+)

diff --git a/problems/kamacoder/0099.岛屿的数量广搜.md b/problems/kamacoder/0099.岛屿的数量广搜.md
index b9bdb796..def79bf7 100644
--- a/problems/kamacoder/0099.岛屿的数量广搜.md
+++ b/problems/kamacoder/0099.岛屿的数量广搜.md
@@ -192,6 +192,56 @@ int main() {
 
 ### Python
 
+```python
+from collections import deque
+
+# 四个方向
+position = [[0, 1], [1, 0], [0, -1], [-1, 0]]
+
+
+def bfs(grid, visited, x, y):
+    """
+    广度优先搜索对陆地进行标记
+    """
+
+    que = deque()  # 创建队列
+
+    # 标记当前节点并加入队列
+    visited[x][y] = True
+    que.append([x, y])
+
+    while que:
+        cur_x, cur_y = que.popleft()  # 取出队首节点
+        for i, j in position:
+            next_x = cur_x + i
+            next_y = cur_y + j
+            # 下一节点下标越界，跳过
+            if next_x < 0 or next_x >= len(grid) or next_y < 0 or next_y >= len(grid[0]):
+                continue
+            # 下一节点是陆地且未被访问,标记节点并加入队列
+            if grid[next_x][next_y] == 1 and not visited[next_x][next_y]:
+                visited[next_x][next_y] = True
+                que.append([next_x, next_y])
+
+
+n, m = map(int, input().split())
+# 邻接矩阵
+grid = []
+for i in range(n):
+    grid.append(list(map(int, input().split())))
+
+visited = [[False] * m for _ in range(n)]  # 访问表
+
+res = 0
+for i in range(n):
+    for j in range(m):
+        if grid[i][j] == 1 and not visited[i][j]:
+            res += 1
+            bfs(grid, visited, i, j)
+
+print(res)
+```
+
 ### Go
 
 ### Rust

From cc7a9433e05d450b8f8bc732a8b15a27359bdd78 Mon Sep 17 00:00:00 2001
From: kimoge <1579457263@qq.com>
Date: Fri, 19 Jul 2024 10:42:00 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E5=8D=A1=E7=A0=81100=5F?=
 =?UTF-8?q?=E5=A2=9E=E5=8A=A0Python3=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/kamacoder/0100.岛屿的最大面积.md b/problems/kamacoder/0100.岛屿的最大面积.md
index 43e7e968..024e509f 100644
--- a/problems/kamacoder/0100.岛屿的最大面积.md
+++ b/problems/kamacoder/0100.岛屿的最大面积.md
@@ -226,6 +226,100 @@ public:
 
 ### Python
 
+DFS
+
+```python
+# 四个方向
+position = [[0, 1], [1, 0], [0, -1], [-1, 0]]
+count = 0
+
+
+def dfs(grid, visited, x, y):
+    """
+    深度优先搜索，对一整块陆地进行标记
+    """
+    global count  # 定义全局变量，便于传递count值
+    for i, j in position:
+        cur_x = x + i
+        cur_y = y + j
+        # 下标越界，跳过
+        if cur_x < 0 or cur_x >= len(grid) or cur_y < 0 or cur_y >= len(grid[0]):
+            continue
+        if not visited[cur_x][cur_y] and grid[cur_x][cur_y] == 1:
+            visited[cur_x][cur_y] = True
+            count += 1
+            dfs(grid, visited, cur_x, cur_y)
+
+
+n, m = map(int, input().split())
+# 邻接矩阵
+grid = []
+for i in range(n):
+    grid.append(list(map(int, input().split())))
+# 访问表
+visited = [[False] * m for _ in range(n)]
+
+result = 0  # 记录最终结果
+for i in range(n):
+    for j in range(m):
+        if grid[i][j] == 1 and not visited[i][j]:
+            count = 1
+            visited[i][j] = True
+            dfs(grid, visited, i, j)
+            result = max(count, result)
+
+print(result)
+```
+
+BFS
+
+```python
+from collections import deque
+
+position = [[0, 1], [1, 0], [0, -1], [-1, 0]]  # 四个方向
+count = 0
+
+
+def bfs(grid, visited, x, y):
+    """
+    广度优先搜索对陆地进行标记
+    """
+    global count  # 声明全局变量
+    que = deque()
+    que.append([x, y])
+    while que:
+        cur_x, cur_y = que.popleft()
+        for i, j in position:
+            next_x = cur_x + i
+            next_y = cur_y + j
+            # 下标越界，跳过
+            if next_x < 0 or next_x >= len(grid) or next_y < 0 or next_y >= len(grid[0]):
+                continue
+            if grid[next_x][next_y] == 1 and not visited[next_x][next_y]:
+                visited[next_x][next_y] = True
+                count += 1
+                que.append([next_x, next_y])
+
+
+n, m = map(int, input().split())
+# 邻接矩阵
+grid = []
+for i in range(n):
+    grid.append(list(map(int, input().split())))
+visited = [[False] * m for _ in range(n)]  # 访问表
+
+result = 0  # 记录最终结果
+for i in range(n):
+    for j in range(m):
+        if grid[i][j] == 1 and not visited[i][j]:
+            count = 1
+            visited[i][j] = True
+            bfs(grid, visited, i, j)
+            res = max(result, count)
+
+print(result)
+```
+
 ### Go
 
 ### Rust