0-1背包问题——java

解法一：
dp[i][j] : 从第i个物品开始挑选总重小于j时，总价值的最大值
递推式：

代码：

import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] w = new int[n];
		int[] v = new int[n];
		for(int i = 0;i < n;i++) {
			w[i] = sc.nextInt();
			v[i] = sc.nextInt();
		}
		int W = sc.nextInt();
		sc.close();
		int[][] dp = new int[9999][9999];
		for(int i = n-1;i >= 0;i--) {
			for(int j = 0; j <= W;j++) {
				if(j < w[i]) {
					dp[i][j] = dp[i+1][j];
				}
				else {
					dp[i][j] = Math.max(dp[i+1][j], dp[i+1][j-w[i]]+v[i]);
				}
			}
		}
		System.out.println(dp[0][W]);
	}
}

解法二（解法一的优化）：
直接采用一维数组：

import java.util.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] w = new int[n];
		int[] v = new int[n];
		for(int i = 0;i < n;i++) {
			w[i] = sc.nextInt();
			v[i] = sc.nextInt();
		}
		int W = sc.nextInt();
		sc.close();
		int[] dp = new int[9999];
		for(int i = 0;i < n;i++) {
			for(int j = W;j >= w[i];j--) {
				dp[j] = Math.max(dp[j], dp[j-w[i]]+v[i]);
			}
		}
		System.out.println(dp[W]);
	}
}