From 076d87605e29d2474f89d2e7312d2a9a2fc69818 Mon Sep 17 00:00:00 2001
From: Shixiaocaia <68102662+shixiaocaia@users.noreply.github.com>
Date: Wed, 30 Aug 2023 11:26:53 +0800
Subject: [PATCH 1/3] =?UTF-8?q?Update=200797.=E6=89=80=E6=9C=89=E5=8F=AF?=
 =?UTF-8?q?=E8=83=BD=E7=9A=84=E8=B7=AF=E5=BE=84=20Go=E5=86=99=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0797.所有可能的路径.md | 28 ++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0797.所有可能的路径.md b/problems/0797.所有可能的路径.md
index ec8288c6..5c209f60 100644
--- a/problems/0797.所有可能的路径.md
+++ b/problems/0797.所有可能的路径.md
@@ -217,6 +217,34 @@ class Solution:
             self.path.pop() # 回溯
 ```
 
+### Go
+
+```go
+func allPathsSourceTarget(graph [][]int) [][]int {
+    result := make([][]int, 0)
+
+    var trace func(path []int, step int)
+    trace = func(path []int, step int){
+        // 从0遍历到length-1
+        if step == len(graph) - 1{
+            tmp := make([]int, len(path))
+            copy(tmp, path)
+            result = append(result, tmp)
+            return 
+        }
+
+        for i := 0; i < len(graph[step]); i++{
+            next := append(path, graph[step][i])
+            trace(next, graph[step][i])
+        }
+    }
+    // 从0开始，开始push 0进去
+    trace([]int{0}, 0)
+    return result 
+}
+
+```
+
 
 
 <p align="center">

From 0bfd53394e9062d284586319a50aaf6cc23755eb Mon Sep 17 00:00:00 2001
From: Shixiaocaia <68102662+shixiaocaia@users.noreply.github.com>
Date: Wed, 30 Aug 2023 11:35:06 +0800
Subject: [PATCH 2/3] =?UTF-8?q?Update=200797.=E6=89=80=E6=9C=89=E5=8F=AF?=
 =?UTF-8?q?=E8=83=BD=E7=9A=84=E8=B7=AF=E5=BE=84=20Go=E5=86=99=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

更新函数名为dfs
---
 problems/0797.所有可能的路径.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/problems/0797.所有可能的路径.md b/problems/0797.所有可能的路径.md
index 5c209f60..e97a6d0d 100644
--- a/problems/0797.所有可能的路径.md
+++ b/problems/0797.所有可能的路径.md
@@ -223,8 +223,8 @@ class Solution:
 func allPathsSourceTarget(graph [][]int) [][]int {
     result := make([][]int, 0)
 
-    var trace func(path []int, step int)
-    trace = func(path []int, step int){
+    var dfs func(path []int, step int)
+    dfs = func(path []int, step int){
         // 从0遍历到length-1
         if step == len(graph) - 1{
             tmp := make([]int, len(path))
@@ -235,11 +235,11 @@ func allPathsSourceTarget(graph [][]int) [][]int {
 
         for i := 0; i < len(graph[step]); i++{
             next := append(path, graph[step][i])
-            trace(next, graph[step][i])
+            dfs(next, graph[step][i])
         }
     }
     // 从0开始，开始push 0进去
-    trace([]int{0}, 0)
+    dfs([]int{0}, 0)
     return result 
 }
 

From 6dcc537cef392a24caa636667f1bd4730d9f2898 Mon Sep 17 00:00:00 2001
From: Shixiaocaia <68102662+shixiaocaia@users.noreply.github.com>
Date: Wed, 30 Aug 2023 11:56:10 +0800
Subject: [PATCH 3/3] =?UTF-8?q?Update=200200.=E5=B2=9B=E5=B1=BF=E6=95=B0?=
 =?UTF-8?q?=E9=87=8F.=E6=B7=B1=E6=90=9C=E7=89=88=20Go=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0200.岛屿数量.深搜版.md b/problems/0200.岛屿数量.深搜版.md
index f610e323..ad4a6ede 100644
--- a/problems/0200.岛屿数量.深搜版.md
+++ b/problems/0200.岛屿数量.深搜版.md
@@ -219,7 +219,7 @@ class Solution {
 }
 ```
 
-Python:
+### Python:
 
 ```python
 # 版本一
@@ -279,6 +279,56 @@ class Solution:
         return result
 ```
 
+### Go
+
+```go
+func numIslands(grid [][]byte) int {
+    // 用1标记已访问
+    visited := make([][]int, len(grid))
+    for i := 0; i < len(visited); i++{
+        visited[i] = make([]int, len(grid[0]))
+    }
+
+    var bfs func(x, y int)
+    bfs = func(x, y int){
+        stack := make([][]int, 0)
+        stack = append(stack, []int{x, y})
+        moveX := []int{1, -1, 0, 0}
+        moveY := []int{0, 0, 1, -1} 
+
+        for len(stack) != 0{
+            node := stack[len(stack) - 1]
+            stack = stack[:len(stack) - 1]
+
+            for i := 0; i < 4; i++{
+                dx := moveX[i] + node[0]
+                dy := moveY[i] + node[1]
+                if dx < 0 || dx >= len(grid) || dy < 0 || dy >= len(grid[0]) || visited[dx][dy] == 1{
+                    continue
+                }
+                visited[dx][dy] = 1
+                if grid[dx][dy] == '1'{
+                    stack = append(stack, []int{dx,dy})
+                }
+            }
+        }
+    }
+
+    result := 0
+    for i := 0; i < len(grid); i++{
+        for j := 0; j < len(grid[0]); j++{
+            if visited[i][j] == 0 && grid[i][j] == '1'{
+                bfs(i, j)
+                visited[i][j] = 1
+                result++
+            }
+        }
+    }
+
+    return result
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>