From 83a87ab5ad2f1dd0f81f3e779921a46c15d979f8 Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Tue, 30 May 2023 16:28:09 +0800
Subject: [PATCH 1/3] =?UTF-8?q?Update=200279.=E5=AE=8C=E5=85=A8=E5=B9=B3?=
 =?UTF-8?q?=E6=96=B9=E6=95=B0.md=20about=20Rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index f5b23d26..d5736951 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -345,6 +345,29 @@ function numSquares(n: number): number {
 };
 ```
 
+Rust:
+
+```rust
+// 先遍历背包
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![i32::MAX; n + 1];
+        dp[0] = 0;
+        for i in 0..=n {
+            let mut j = 1;
+            loop {
+                match j * j > i {
+                    true => break,
+                    false => dp[i] = dp[i].min(dp[i - j * j] + 1),
+                }
+                j += 1;
+            }
+        }
+        dp[n]
+    }
+}
+```
 
 
 <p align="center">

From a2ff242303546243f606e717e34ff8d2965eeb9d Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Tue, 30 May 2023 18:30:14 +0800
Subject: [PATCH 2/3] =?UTF-8?q?Update=200279.=E5=AE=8C=E5=85=A8=E5=B9=B3?=
 =?UTF-8?q?=E6=96=B9=E6=95=B0.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index d5736951..1a0b55c0 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -369,6 +369,27 @@ impl Solution {
 }
 ```
 
+```rust
+// 先遍历物品
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (n, mut goods) = (n as usize, 1);
+        let mut dp = vec![i32::MAX; n + 1];
+        dp[0] = 0;
+        loop {
+            if goods * goods > n {
+                break;
+            }
+            for j in goods * goods..=n {
+                dp[j] = dp[j].min(dp[j - goods * goods] + 1);
+            }
+            goods += 1;
+        }
+        dp[n]
+    }
+}
+```
+
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">

From 46495a7753ebf1eb603891229375e06fc1f05a07 Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Tue, 30 May 2023 21:21:02 +0800
Subject: [PATCH 3/3] =?UTF-8?q?Update=200279.=E5=AE=8C=E5=85=A8=E5=B9=B3?=
 =?UTF-8?q?=E6=96=B9=E6=95=B0.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
index 1a0b55c0..71ab1906 100644
--- a/problems/0279.完全平方数.md
+++ b/problems/0279.完全平方数.md
@@ -331,6 +331,7 @@ var numSquares2 = function(n) {
 TypeScript：
 
 ```typescript
+// 先遍历物品
 function numSquares(n: number): number {
     const goodsNum: number = Math.floor(Math.sqrt(n));
     const dp: number[] = new Array(n + 1).fill(Infinity);
@@ -345,6 +346,20 @@ function numSquares(n: number): number {
 };
 ```
 
+```rust
+// 先遍历背包
+function numSquares(n: number): number {
+  const dp = 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], dp[i -j * j] + 1)
+      }
+  }
+  return dp[n]
+};
+```
+
 Rust:
 
 ```rust