From 7a6bf94cfac1a80f137f054732491b0592855eae Mon Sep 17 00:00:00 2001
From: fusunx <1102654482@qq.com>
Date: Tue, 10 Aug 2021 07:10:19 +0800
Subject: [PATCH] =?UTF-8?q?0279.=E5=AE=8C=E5=85=A8=E5=B9=B3=E6=96=B9?=
 =?UTF-8?q?=E6=95=B0=20Javascript?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index d0922de1..e3eb6f8c 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -286,7 +286,35 @@ func min(a, b int) int {
 }
 ```
 
+Javascript:
+```Javascript
+// 先遍历物品，再遍历背包
+var numSquares1 = function(n) {
+    let dp = new Array(n + 1).fill(Infinity)
+    dp[0] = 0
 
+    for(let i = 0; i <= n; i++) {
+        let val = i * i
+        for(let j = val; j <= n; j++) {
+            dp[j] = Math.min(dp[j], dp[j - val] + 1)
+        }
+    }
+    return dp[n]
+};
+// 先遍历背包，再遍历物品
+var numSquares2 = function(n) {
+    let dp = new Array(n + 1).fill(Infinity)
+    dp[0] = 0
+
+    for(let i = 1; i <= n; i++) {
+        for(let j = 1; j * j <= i; j++) {
+            dp[i] = Math.min(dp[i - j * j] + 1, dp[i])
+        }
+    }
+
+    return dp[n]
+};
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)