最少背包问题算法详解与代码实现

“最少背包”程序
import java.util.*;
public class Modeling {
   public static void main(String[] args) throws Throwable {
                          
        double[] CarRecord = 
{9,5,4,10,16,8,8,7,8,6,8,7,15,6,10,6,15,5,15,47,8,4,8,5,8,9,5,6,13,5,17,19,14,11,17,3,9,14,13,4,6,17,7,11,12,10,5,6,4,5,5};  //周四维修车辆（C3到C53）记录次数
        double PlatRecord = 49;  //每个维修平台一天总的记录次数
        double TotalRecord = 0;  //所有车辆的总的记录次数
        for (double d : CarRecord) {
            TotalRecord += d;
        }
        int count = (int)(TotalRecord / PlatRecord);  //计算最少需要的维修平台数量
        if (count < TotalRecord / PlatRecord) count++;
 
        double[] weight = new double[count];  //每个维修台已经放入的车子总记录数量
        List<List<Integer>> boxes = new ArrayList<List<Integer>>(); //维修平台修的车子标记
        for (int i=0; i<count; i++) {
            boxes.add(new LinkedList<Integer>());
        }
        List<Integer> loaded = new LinkedList<Integer>(); //已放置过的车辆的标记
        List<List<Integer>> used = new ArrayList<List<Integer>>(); 
         for (int i=0; i<CarRecord.length; i++) { //记录维修车子的顺序
            used.add(new LinkedList<Integer>());
        }
        int box = 0, index = 0;
         
        for (int cnt=count; cnt<=CarRecord.length; cnt++) { 
            if (cnt > boxes.size()) boxes.add(new LinkedList<Integer>());
            //初始化