Update 背包问题理论基础完全背包.md about rust

problems/背包问题理论基础完全背包.md

@@ -388,6 +388,43 @@ object Solution {
 }
 ```
 
+Rust:
+
+```rust
+impl Solution {
+    // 先遍历物品
+    fn complete_pack() {
+        let (goods, bag_size) = (vec![(1, 15), (3, 20), (4, 30)], 4);
+        let mut dp = vec![0; bag_size + 1];
+        for (weight, value) in goods {
+            for j in weight..=bag_size {
+                dp[j] = dp[j].max(dp[j - weight] + value);
+            }
+        }
+        println!("先遍历物品：{}", dp[bag_size]);
+    }
+
+    // 先遍历背包
+    fn complete_pack_after() {
+        let (goods, bag_size) = (vec![(1, 15), (3, 20), (4, 30)], 4);
+        let mut dp = vec![0; bag_size + 1];
+        for i in 0..=bag_size {
+            for (weight, value) in &goods {
+                if i >= *weight {
+                    dp[i] = dp[i].max(dp[i - weight] + value);
+                }
+            }
+        }
+        println!("先遍历背包：{}", dp[bag_size]);
+    }
+}
+
+#[test]
+fn test_complete_pack() {
+    Solution::complete_pack();
+    Solution::complete_pack_after();
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">