From 9b5c5ebeea85b133514ab42c0218b79e13599b45 Mon Sep 17 00:00:00 2001
From: limuxuale0927 <limuxuale0927@hotmail.com>
Date: Fri, 14 Jul 2023 22:07:13 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200200.=E5=B2=9B=E5=B1=BF?=
 =?UTF-8?q?=E6=95=B0=E9=87=8F.=E6=B7=B1=E6=90=9C=E7=89=88.md=20Python3=20?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0200.岛屿数量.深搜版.md | 61 +++++++++++++++++++++++++
 1 file changed, 61 insertions(+)

diff --git a/problems/0200.岛屿数量.深搜版.md b/problems/0200.岛屿数量.深搜版.md
index c30ace19..f610e323 100644
--- a/problems/0200.岛屿数量.深搜版.md
+++ b/problems/0200.岛屿数量.深搜版.md
@@ -218,6 +218,67 @@ class Solution {
     }
 }
 ```
+
+Python:
+
+```python
+# 版本一
+class Solution:
+    def numIslands(self, grid: List[List[str]]) -> int:
+        m, n = len(grid), len(grid[0])
+        visited = [[False] * n for _ in range(m)]
+        dirs = [(-1, 0), (0, 1), (1, 0), (0, -1)]  # 四个方向
+        result = 0
+
+        def dfs(x, y):
+            for d in dirs:
+                nextx = x + d[0]
+                nexty = y + d[1]
+                if nextx < 0 or nextx >= m or nexty < 0 or nexty >= n:  # 越界了，直接跳过
+                    continue
+                if not visited[nextx][nexty] and grid[nextx][nexty] == '1':  # 没有访问过的同时是陆地的
+                    visited[nextx][nexty] = True
+                    dfs(nextx, nexty)
+        
+        for i in range(m):
+            for j in range(n):
+                if not visited[i][j] and grid[i][j] == '1':
+                    visited[i][j] = True
+                    result += 1  # 遇到没访问过的陆地，+1
+                    dfs(i, j)  # 将与其链接的陆地都标记上 true
+
+        return result
+```
+
+```python
+# 版本二
+class Solution:
+    def numIslands(self, grid: List[List[str]]) -> int:
+        m, n = len(grid), len(grid[0])
+        visited = [[False] * n for _ in range(m)]
+        dirs = [(-1, 0), (0, 1), (1, 0), (0, -1)]  # 四个方向
+        result = 0
+
+        def dfs(x, y):
+            if visited[x][y] or grid[x][y] == '0':
+                return  # 终止条件：访问过的节点 或者 遇到海水
+            visited[x][y] = True
+            for d in dirs:
+                nextx = x + d[0]
+                nexty = y + d[1]
+                if nextx < 0 or nextx >= m or nexty < 0 or nexty >= n:  # 越界了，直接跳过
+                    continue
+                dfs(nextx, nexty)
+        
+        for i in range(m):
+            for j in range(n):
+                if not visited[i][j] and grid[i][j] == '1':
+                    result += 1  # 遇到没访问过的陆地，+1
+                    dfs(i, j)  # 将与其链接的陆地都标记上 true
+
+        return result
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>