01揹包java代碼

完美世界筆試編程  

import java.util.Scanner;

public class Main {
	 public static void main(String[] args) {	
		 Scanner sc=new Scanner(System.in);
		 int n=sc.nextInt();
		 //w 物品的重量
		 //p 物品的價值
		 int[] w=new int[n];
		 int[] p=new int[n];
		 for(int i=0;i<n;i++) p[i]=sc.nextInt();
		 for(int i=0;i<n;i++) w[i]=sc.nextInt();
		 int m=sc.nextInt();
	     int c[][] = BackPack_Solution(m, n, w, p);
	     System.out.println(c[n][m]);
	    }
	    public static int[][] BackPack_Solution(int m, int n, int[] w, int[] p) {
	    	//c[n+1][m+1]
	        int c[][] = new int[n + 1][m + 1];
	        for (int i = 0; i < n + 1; i++)
	            c[i][0] = 0;//沒有物品 價值0
	        for (int j = 0; j < m + 1; j++)
	            c[0][j] = 0;//沒有空間 價值 0；
	        for (int i = 1; i < n + 1; i++) {
	            for (int j = 1; j < m + 1; j++) {
	                if (w[i - 1] <= j) {//第i個物品所佔空間與所剩空間比
	                    if (c[i - 1][j] < (c[i - 1][j - w[i - 1]] + p[i - 1]))//放與不放作比較
	                        c[i][j] = c[i - 1][j - w[i - 1]] + p[i - 1];
	                    else
	                        c[i][j] = c[i - 1][j];
	                } else
	                    c[i][j] = c[i - 1][j];//第i個物品放不進去
	            }
	        }
	        return c;
	    }
}