动态规划算法-求解01背包问题

1.问题描述
问题描述参鉴https://blog.csdn.net/liufeng_king/article/details/8683136
2.求解

package com.chb.DP;

public class Pack01 {
	int[]value;//物品价值
	int[]weight;//物品重量
	int c;//背包容量
	int[][]m;
	int[]x;//放入为1，不放入为0
	public Pack01(int[] value, int[] weight, int c) {
		super();
		this.value = value;
		this.weight = weight;
		this.c = c;
		int max=maxM(weight,c);
		this.m = new int[value.length][max+1];
		this.x = new int[value.length];
	}
	public int maxM(int[]weight,int c) {
		int max=c;
		for (int i = 1; i < weight.length; i++) {
			if(weight[i]>c) {
				max=weight[i];
			}
		}
		return max;
	}
	public void knapsack(int[]value,int[]weight,int c,int[][]m) {
		int n=value.length-1;
		int jMax=Math.min(weight[n-1], c);
		for (int j = 0; j <=jMax; j++) {
			m[n][j]=0;
		}
		for (int j = weight[n]; j <=c; j++) {
			m[n][j]=value[n];
		}
		for (int i = n-1; i >1; i--) {
			jMax=Math.min(weight[i]-1, c);
			for (int j = 0; j <=jMax; j++) {
				m[i][j]=m[i+1][j];
			}
			for (int j = weight[i]; j <=c; j++) {
				m[i][j]=Math.max(m[i+1][j], m[i+1][j-weight[i]]+value[i]);
			}
		}
		if(c>=weight[1]) {
			m[1][c]=Math.max(m[2][c], m[2][c-weight[1]]+value[1]);
		}else {
			m[1][c]=m[2][c];
		}
	}
	public void traceback(int[][]m,int[]weight,int c,int[]x) {
		int n=weight.length-1;
		for (int i = 1; i <n; i++) {
			if(m[i][c]==m[i+1][c]) {
				x[i]=0;
			}else {
				x[i]=1;
				c-=weight[i];
			}
		}
		x[n]=(m[n][c]>0)?1:0;
	}
	public static void main(String[] args) {
		int value[]={0,2,1,4,3};
		int weight[]={0,1,4,2,3};
		int c=8;
		Pack01 pa=new Pack01(value,weight,c);
		pa.knapsack(pa.value, pa.weight, pa.c, pa.m);
		System.out.println("装入背包中物品总价值最大为：");
		System.out.println(pa.m[1][c]);
		pa.traceback(pa.m, pa.weight, pa.c, pa.x);
		System.out.println("装入的物品的序号为：");
		for (int i = 0; i <value.length; i++) {
			if(pa.x[i]==1) {
				System.out.print(i+" ");
			}
		}
	}
}

运行结果：