algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-23 12:35:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/main/java/com/thealgorithms/dynamicprogramming/Knapsack.java
View File

@ -5,7 +5,8 @@ package com.thealgorithms.dynamicprogramming;
*/
public class Knapsack {
private static int knapSack(int W, int wt[], int val[], int n) throws IllegalArgumentException {
private static int knapSack(int W, int wt[], int val[], int n)
throws IllegalArgumentException {
if (wt == null || val == null) {
throw new IllegalArgumentException();
}
@ -18,7 +19,11 @@ public class Knapsack {
if (i == 0 || w == 0) {
rv[i][w] = 0;
} else if (wt[i - 1] <= w) {
rv[i][w] = Math.max(val[i - 1] + rv[i - 1][w - wt[i - 1]], rv[i - 1][w]);
rv[i][w] =
Math.max(
val[i - 1] + rv[i - 1][w - wt[i - 1]],
rv[i - 1][w]
);
} else {
rv[i][w] = rv[i - 1][w];
}
@ -30,8 +35,8 @@ public class Knapsack {
// Driver program to test above function
public static void main(String args[]) {
int val[] = new int[]{50, 100, 130};
int wt[] = new int[]{10, 20, 40};
int val[] = new int[] { 50, 100, 130 };
int wt[] = new int[] { 10, 20, 40 };
int W = 50;
System.out.println(knapSack(W, wt, val, val.length));
}