每日算法第101期：算法实验3（动态规划）

编写一个简单的程序，解决0-1背包问题。设N=5，C=10，w={2，2，6，5，4},v={6,3,5,4,6}``

package org.csu.shiyan_3;

import sun.dc.pr.PRError;

public class quesstion0_1bag {
   
    public static void main(String[] args) {
   
         int MaxWeight = 10;
         int NumofItems = 5;
         int []weight = new int[]{
   2,2,6,5,4};
         int[] value = new int []{
   6,3,5,4,6};
        System.out.println("最后的结果为");
        System.out.println(solution(MaxWeight,NumofItems,weight,value));
        System.out.println("表格为");
        for(int j = 1;j<=NumofItems;j++){
   
            for(int i = 1;i<=MaxWeight;i++){
   
                System.out.print(solution(