From cf0da45e1b9b5302d751ffabbb8603f702d29a0c Mon Sep 17 00:00:00 2001
From: zhangzw <zhangzw@boqii.com>
Date: Wed, 26 May 2021 18:14:08 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00063.=E4=B8=8D=E5=90=8C?=
 =?UTF-8?q?=E8=B7=AF=E5=BE=84II=20Go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0063.不同路径II.md | 43 +++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
index 72189e0f..eeecad70 100644
--- a/problems/0063.不同路径II.md
+++ b/problems/0063.不同路径II.md
@@ -235,6 +235,49 @@ class Solution:
 
 Go：
 
+```go
+func uniquePathsWithObstacles(obstacleGrid [][]int) int {
+	m,n:= len(obstacleGrid),len(obstacleGrid[0])
+	// 定义一个dp数组
+	dp := make([][]int,m)
+	for i,_ := range dp {
+		dp[i] = make([]int,n)
+	}
+	// 初始化
+	for i:=0;i<m;i++ {
+		// 如果是障碍物, 后面的就都是0, 不用循环了
+		if obstacleGrid[i][0] == 1 {
+			break
+		}
+		dp[i][0]=1
+	}
+	for i:=0;i<n;i++ {
+		if obstacleGrid[0][i] == 1 {
+			break
+		}
+		dp[0][i]=1
+	}
+	// dp数组推导过程
+	for i:=1;i<m;i++ {
+		for j:=1;j<n;j++ {
+			// 如果obstacleGrid[i][j]这个点是障碍物, 那么我们的dp[i][j]保持为0
+           	 	if obstacleGrid[i][j] != 1 {
+				// 否则我们需要计算当前点可以到达的路径数
+				dp[i][j] = dp[i-1][j]+dp[i][j-1]
+			}
+		}
+	}
+	// debug遍历dp
+	//for i,_ := range dp {
+	//	for j,_ := range dp[i] {
+	//		fmt.Printf("%.2v,",dp[i][j])
+	//	}
+	//	fmt.Println()
+	//}
+	return dp[m-1][n-1]
+}
+
+```