From 22ae299a273f69ebbc7411309b9dfee3c2e2a9d3 Mon Sep 17 00:00:00 2001
From: Echo0701 <133868458+Echo0701@users.noreply.github.com>
Date: Thu, 30 Nov 2023 18:48:52 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E8=83=8C=E5=8C=85=E9=97=AE?=
 =?UTF-8?q?=E9=A2=98=E7=90=86=E8=AE=BA=E5=9F=BA=E7=A1=80=E5=A4=9A=E9=87=8D?=
 =?UTF-8?q?=E8=83=8C=E5=8C=85=E7=9A=84=20Java=20=E8=AF=AD=E8=A8=80?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../背包问题理论基础多重背包.md   | 36 +++++++++++++++++++
 1 file changed, 36 insertions(+)

diff --git a/problems/背包问题理论基础多重背包.md b/problems/背包问题理论基础多重背包.md
index b19b5273..5d6440e3 100644
--- a/problems/背包问题理论基础多重背包.md
+++ b/problems/背包问题理论基础多重背包.md
@@ -165,7 +165,43 @@ int main() {
 
 ### Java：
 
+```Java
+import java.util.Scanner;
+class multi_pack{
+    public static void main(String [] args) {
+        Scanner sc = new Scanner(System.in);
 
+        /**
+         * bagWeight:背包容量
+         * n:物品种类
+         */
+        int bagWeight, n;
+        
+        //获取用户输入数据，中间用空格隔开，回车键换行
+        bagWeight = sc.nextInt();
+        n = sc.nextInt();
+        int[] weight = new int[n];
+        int[] value = new int[n];
+        int[] nums = new int[n];
+        for (int i = 0; i < n; i++) weight[i] = sc.nextInt();
+        for (int i = 0; i < n; i++) value[i] = sc.nextInt();
+        for (int i = 0; i < n; i++) nums[i] = sc.nextInt();
+
+        int[] dp = new int[bagWeight + 1];
+
+        //先遍历物品再遍历背包，作为01背包处理
+        for (int i = 0; i < n; i++) {
+            for (int j = bagWeight; j >= weight[i]; j--) {
+                //遍历每种物品的个数
+                for (int k = 1; k <= nums[i] && (j - k * weight[i]) >= 0; k++) {
+                    dp[j] = Math.max(dp[j], dp[j - k * weight[i]] + k * value[i]);
+                }
+            }
+        }
+        System.out.println(dp[bagWeight]);
+    }
+}
+```
 ### Python：
 
 ### Go：