From 13fe71327758c072a7b817e98e0ebfbcd6adba99 Mon Sep 17 00:00:00 2001
From: zhangzw <zhangzw@boqii.com>
Date: Tue, 8 Jun 2021 15:41:05 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00070.=E7=88=AC=E6=A5=BC?=
 =?UTF-8?q?=E6=A2=AF=E5=AE=8C=E5=85=A8=E8=83=8C=E5=8C=85=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=20Go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0070.爬楼梯完全背包版本.md | 21 +++++++++++++++++++-
 1 file changed, 20 insertions(+), 1 deletion(-)

diff --git a/problems/0070.爬楼梯完全背包版本.md b/problems/0070.爬楼梯完全背包版本.md
index 69750f8f..9fc33bb8 100644
--- a/problems/0070.爬楼梯完全背包版本.md
+++ b/problems/0070.爬楼梯完全背包版本.md
@@ -149,7 +149,26 @@ Python：
 
 
 Go：
-
+```go
+func climbStairs(n int) int {
+	//定义
+	dp := make([]int, n+1)
+	//初始化
+	dp[0] = 1
+	// 本题物品只有两个1,2
+	m := 2
+	// 遍历顺序
+	for j := 1; j <= n; j++ {	//先遍历背包
+		for i := 1; i <= m; i++ {	//再遍历物品
+			if j >= i {
+				dp[j] += dp[j-i]
+			}
+			//fmt.Println(dp)
+		}
+	}
+	return dp[n]
+}
+```