Question

Can I have a Knapsack java program best solution

Answer 1

Java program using Dynamic programming to solve Knapsack problem:
Please find the code below with proper indentation:

Code:

public static void main(String args[]) Scanner scnew Scanner (System.in); System.out.println("Enter the number of items: "); int n sc.nextIntO; System.out.println("Enter the items weights: "); int [1wtnew intInl for(int i-0; i<n; i++) wt[i] - sc.nextInt (); System.out.println("Enter the items values: "); int [lvalnew int[n]; for(int i-0; i<n; i++) val[i] sc.nextInt(); System.out.println("Enter the maximum capacity: "); int พ-sc.nextInt(); System.out.printIn("The maximum value that can be put in a knapsack of capacity พ is: " + knapsack(w, wt, val, n)); sc.close();

Please find the output below:

s javac Knapsack DP.java s java Knapsack_DP Enter the number of items: Enter the items weights: 01 56 42 78 12 Enter the items values: 50 30 20 10 50 Enter the maximum capacity: 150 The maximum value that can be put in a knapsack of capacity W is: 150