From fd2dfc4c0139d3296470271c5b1e0bd9af1303ba Mon Sep 17 00:00:00 2001
From: haofeng <852172305@qq.com>
Date: Sat, 12 Jun 2021 10:43:17 +0800
Subject: [PATCH] =?UTF-8?q?Update=200279.=E5=AE=8C=E5=85=A8=E5=B9=B3?=
 =?UTF-8?q?=E6=96=B9=E6=95=B0.md=20=E6=B7=BB=E5=8A=A0=20python3=20?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index 8d8b161c..60d6d165 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -26,7 +26,7 @@
 输入：n = 13
 输出：2
 解释：13 = 4 + 9
- 
+
 提示：
 * 1 <= n <= 10^4
 
@@ -184,6 +184,38 @@ class Solution {
 
 Python：
 
+```python3
+class Solution:
+    def numSquares(self, n: int) -> int:
+        '''版本一'''
+        # 初始化
+        nums = [i**2 for i in range(1, n + 1) if i**2 <= n]
+        dp = [10**4]*(n + 1)
+        dp[0] = 0
+        # 遍历背包
+        for j in range(1, n + 1):
+            # 遍历物品
+            for num in nums:
+                if j >= num:
+                    dp[j] = min(dp[j], dp[j - num] + 1)
+        return dp[n]
+    
+    def numSquares1(self, n: int) -> int:
+        '''版本二'''
+        # 初始化
+        nums = [i**2 for i in range(1, n + 1) if i**2 <= n]
+        dp = [10**4]*(n + 1)
+        dp[0] = 0
+        # 遍历物品
+        for num in nums:
+            # 遍历背包
+            for j in range(num, n + 1)
+                dp[j] = min(dp[j], dp[j - num] + 1)
+        return dp[n]
+```
+
+
+
 
 Go：
 ```go