mindol1004/spring-boot-rest
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

BAEL-3349, Add brackets and make the class public

Browse Source
This commit is contained in:
Gang
2019-10-15 21:19:57 -06:00
parent 16e764c942
commit 85b5042cb7
1 changed files with 11 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/knapsack/Knapsack.java
View File

@@ -1,19 +1,22 @@
package com.baeldung.algorithms.knapsack;
class Knapsack {
public class Knapsack {
public int knapsackRec(int[] w, int[] v, int n, int W) {
if (n <= 0)
if (n <= 0) {
return 0;
else if (w[n - 1] > W)
} else if (w[n - 1] > W) {
return knapsackRec(w, v, n - 1, W);
else
} else {
return Math.max(knapsackRec(w, v, n - 1, W), v[n - 1] + knapsackRec(w, v, n - 1, W - w[n - 1]));
}
}
public int knapsackDP(int[] w, int[] v, int n, int W) {
if (n <= 0 || W <= 0)
if (n <= 0 || W <= 0) {
return 0;
}
int[][] m = new int[n + 1][W + 1];
for (int j = 0; j <= W; j++) {
m[0][j] = 0;
@@ -21,10 +24,11 @@ class Knapsack {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= W; j++) {
if (w[i - 1] > j)
if (w[i - 1] > j) {
m[i][j] = m[i - 1][j];
else
} else {
m[i][j] = Math.max(m[i - 1][j], m[i - 1][j - w[i - 1]] + v[i - 1]);
}
}
}
return m[n][W];