From 41623a2725f6e419f2d4bdef3bfce3a2afbee9d8 Mon Sep 17 00:00:00 2001
From: zhangzw <zhangzw@boqii.com>
Date: Tue, 8 Jun 2021 17:33:44 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00279.=E5=AE=8C=E5=85=A8?=
 =?UTF-8?q?=E5=B9=B3=E6=96=B9=E6=95=B0=20Go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0279.完全平方数.md | 48 ++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index 8d8c1f48..8d8b161c 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -186,7 +186,55 @@ Python：
 
 
 Go：
+```go
+// 版本一,先遍历物品, 再遍历背包
+func numSquares1(n int) int {
+	//定义
+	dp := make([]int, n+1)
+	// 初始化
+	dp[0] = 0
+	for i := 1; i <= n; i++ {
+		dp[i] = math.MaxInt32
+	}
+	// 遍历物品
+	for i := 1; i <= n; i++ {
+		// 遍历背包
+		for j := i*i; j <= n; j++ {
+			dp[j] = min(dp[j], dp[j-i*i]+1)
+		}
+	}
 
+	return dp[n]
+}
+
+// 版本二,先遍历背包, 再遍历物品
+func numSquares2(n int) int {
+	//定义
+	dp := make([]int, n+1)
+	// 初始化
+	dp[0] = 0
+	// 遍历背包
+	for j := 1; j <= n; j++ {
+		//初始化
+		dp[j] = math.MaxInt32
+		// 遍历物品
+		for i := 1; i <= n; i++ {
+			if j >= i*i {
+				dp[j] = min(dp[j], dp[j-i*i]+1)
+			}
+		}
+	}
+
+	return dp[n]
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+```