@@ -183,11 +183,9 @@ private static void testCompletePack(){
183183 int [] value = {15 , 20 , 30 };
184184 int bagWeight = 4 ;
185185 int [] dp = new int [bagWeight + 1 ];
186- for (int i = 0 ; i < weight. length; i++ ){
187- for (int j = 1 ; j <= bagWeight; j++ ){
188- if (j - weight[i] >= 0 ){
189- dp[j] = Math . max(dp[j], dp[j - weight[i]] + value[i]);
190- }
186+ for (int i = 0 ; i < weight. length; i++ ){ // 遍历物品
187+ for (int j = weight[i]; j <= bagWeight; j++ ){ // 遍历背包容量
188+ dp[j] = Math . max(dp[j], dp[j - weight[i]] + value[i]);
191189 }
192190 }
193191 for (int maxValue : dp){
@@ -201,8 +199,8 @@ private static void testCompletePackAnotherWay(){
201199 int [] value = {15 , 20 , 30 };
202200 int bagWeight = 4 ;
203201 int [] dp = new int [bagWeight + 1 ];
204- for (int i = 1 ; i <= bagWeight; i++ ){
205- for (int j = 0 ; j < weight. length; j++ ){
202+ for (int i = 1 ; i <= bagWeight; i++ ){// 遍历背包容量
203+ for (int j = 0 ; j < weight. length; j++ ){// 遍历物品
206204 if (i - weight[j] >= 0 ){
207205 dp[i] = Math . max(dp[i], dp[i - weight[j]] + value[j]);
208206 }
0 commit comments