动态规划之01背包问题
/*
问题描述:
有n个物品,它们有各自的体积和价值,现有给定容量的背包,如何让背包里装入的物品具有最大的价值总和
eg:number = 4 ; capacity = 8 ;
i 物体编号 1 2 3 4
w(体积) 2 3 4 5
v(价值) 3 4 5 6
不完全背包问题
*/
public class Package {//动态规划找到背包所能装下的最大价值
public static int PackAge(int []weight,int []values,int amount)
{
int n=weight.length;
int [][] dp = new int[weight.length][amount+1];
for(int i=1;i<weight.length;i++)
{
for(int j=0;j<=amount;j++) {
dp[i][0] = 0;
dp[0][j] = 0;
if ( j >= weight[i])
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][j-weight[i]]+values[i]);
else
dp[i][j] = dp[i - 1][j];
}
}
return dp[n-1][amount];
}
public static void main(String [] args)
{
int [] weight = {2,3,4,5};
int [] values = {3,4,5,6};
int VALUES = PackAge(weight,values,8);
System.out.println(VALUES);
}
}
递归方法实现
//递归实现01背包问题
public class Bag {
public static int f(int W[],int V[],int i,int j) {
if (i == -1 || j == 0)
return 0;
else {
if (j >= W[i]) {
int p = f(W, V, i - 1, j - W[i]) + V[i];
int Np = f(W, V, i - 1, j);
return p > Np ? p : Np;
} else
return f(W, V, i - 1, j);
}
}
public static void main(String[] args)
{
int []W={2,3,4,5};
int []V={3,4,5,6};
int n=W.length;
int number=f(W,V,n-1,8);
System.out.println(number);
}
}