实验内容
- 使用贪心算法、回溯法、分支限界法解决0-1背包问题;
- 通过上机实验进行算法实现;
- 保存和打印出程序的运行结果,并结合程序进行分析,上交实验报告。
动态:
package org.csu.shiyan_5;
import sun.dc.pr.PRError;
public class Dinggui0_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(i,j,weight,value));
System.out.print("\t");
}
System.out.println();
}
}
public static int solution(int N,int W,int []weight,int []value){
int [][]map = new int[N+1][W+1];
for(int i = 1;i<=W;i++){