From be11452af6c87e47243c8bb65aa86e517e1f4ab8 Mon Sep 17 00:00:00 2001
From: Logen <47022821+Logenleedev@users.noreply.github.com>
Date: Sun, 8 Oct 2023 08:36:54 -0400
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0python=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=E4=B8=89?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0200.岛屿数量.深搜版.md b/problems/0200.岛屿数量.深搜版.md
index c7649971..43eb66e1 100644
--- a/problems/0200.岛屿数量.深搜版.md
+++ b/problems/0200.岛屿数量.深搜版.md
@@ -278,6 +278,40 @@ class Solution:
 
         return result
 ```
+```python 
+# 我们用三个状态去标记每一个格子
+# 0 代表海水
+# 1 代表陆地
+# 2 代表已经访问的陆地
+class Solution:
+    def traversal(self, grid, i, j):
+        m = len(grid)
+        n = len(grid[0])
+
+        if i < 0 or j < 0 or i >= m or j >= n:
+            return   # 越界了
+        elif grid[i][j] == "2" or grid[i][j] == "0":
+            return 
+
+        grid[i][j] = "2"
+        self.traversal(grid, i - 1, j) # 往上走
+        self.traversal(grid, i + 1, j) # 往下走
+        self.traversal(grid, i, j - 1) # 往左走
+        self.traversal(grid, i, j + 1) # 往右走
+
+    def numIslands(self, grid: List[List[str]]) -> int:
+        res = 0
+
+
+        for i in range(len(grid)):
+            for j in range(len(grid[0])):
+                if grid[i][j] == "1":
+                    res += 1
+                    self.traversal(grid, i, j)
+
+        return res
+```
+
 ### JavaScript
 
 ```javascript