feat: add rust solution to lc problem: No.0279 (#1572)

No.0279.Perfect Squares

Author: poltao

solution/0200-0299/0279.Perfect Squares/README.md

@@ -279,6 +279,43 @@ function numSquares(n: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (row, col) = ((n as f32).sqrt().floor() as usize, n as usize);
+        let mut dp = vec![vec![i32::MAX; col + 1]; row + 1];
+        dp[0][0] = 0;
+        for i in 1..=row {
+            for j in 0..=col {
+                dp[i][j] = dp[i - 1][j];
+                if j >= i * i {
+                    dp[i][j] = std::cmp::min(dp[i][j], dp[i][j - i * i] + 1);
+                }
+            }
+        }
+        dp[row][col]
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (row, col) = ((n as f32).sqrt().floor() as usize, n as usize);
+        let mut dp = vec![i32::MAX; col + 1];
+        dp[0] = 0;
+        for i in 1..=row {
+            for j in i * i..=col {
+                dp[j] = std::cmp::min(dp[j], dp[j - i * i] + 1);
+            }
+        }
+        dp[col]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0279.Perfect Squares/README_EN.md

@@ -239,6 +239,43 @@ function numSquares(n: number): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (row, col) = ((n as f32).sqrt().floor() as usize, n as usize);
+        let mut dp = vec![vec![i32::MAX; col + 1]; row + 1];
+        dp[0][0] = 0;
+        for i in 1..=row {
+            for j in 0..=col {
+                dp[i][j] = dp[i - 1][j];
+                if j >= i * i {
+                    dp[i][j] = std::cmp::min(dp[i][j], dp[i][j - i * i] + 1);
+                }
+            }
+        }
+        dp[row][col]
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (row, col) = ((n as f32).sqrt().floor() as usize, n as usize);
+        let mut dp = vec![i32::MAX; col + 1];
+        dp[0] = 0;
+        for i in 1..=row {
+            for j in i * i..=col {
+                dp[j] = std::cmp::min(dp[j], dp[j - i * i] + 1);
+            }
+        }
+        dp[col]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0279.Perfect Squares/Solution.rs

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn num_squares(n: i32) -> i32 {
+        let (row, col) = ((n as f32).sqrt().floor() as usize, n as usize);
+        let mut dp = vec![vec![i32::MAX; col + 1]; row + 1];
+        dp[0][0] = 0;
+        for i in 1..=row {
+            for j in 0..=col {
+                dp[i][j] = dp[i - 1][j];
+                if j >= i * i {
+                    dp[i][j] = std::cmp::min(dp[i][j], dp[i][j - i * i] + 1);
+                }
+            }
+        }
+        dp[row][col]
+    }
+}