update 背包问题理论基础完全背包 java代码

Author: MonkeyBroLL

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

@@ -176,9 +176,48 @@ int main() {
 
 ## 其他语言版本
 
-
 Java：
 
+```java
+		//先遍历物品，再遍历背包
+    private static void testCompletePack(){
+        int[] weight = {1, 3, 4};
+        int[] value = {15, 20, 30};
+        int bagWeight = 4;
+        int[] dp = new int[bagWeight + 1];
+        for (int i = 0; i < weight.length; i++){
+            for (int j = 1; j <= bagWeight; j++){
+                if (j - weight[i] >= 0){
+                    dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
+                }
+            }
+        }
+        for (int maxValue : dp){
+            System.out.println(maxValue + "   ");
+        }
+    }
+
+    //先遍历背包，再遍历物品
+    private static void testCompletePackAnotherWay(){
+        int[] weight = {1, 3, 4};
+        int[] value = {15, 20, 30};
+        int bagWeight = 4;
+        int[] dp = new int[bagWeight + 1];
+        for (int i = 1; i <= bagWeight; i++){
+            for (int j = 0; j < weight.length; j++){
+                if (i - weight[j] >= 0){
+                    dp[i] = Math.max(dp[i], dp[i - weight[j]] + value[j]);
+                }
+            }
+        }
+        for (int maxValue : dp){
+            System.out.println(maxValue + "   ");
+        }
+    }
+```
+
+
+
 Python：
 
 ```python3