最优装载

public class ExcellentLoading {

    /**
     * 轮船的最大容量
     */
    private static Integer total = 0;

    /**
     * 轮船装完物品，剩余重量
     */
    private static Integer residueTotal = 0;

    /**
     * 装入的物品个数
     */
    private static Integer num = 0;

    /**
     * 物品重量数组
     */
    private static Integer[] weight;

    /**
     * 物品存放数组【1：存放  0：不存放】
     */
    private static Integer[] store;

    /**
     * 初始化数据
     */
    private static void initData() {
        Scanner input = new Scanner(System.in);
        System.out.print("请输入轮船的总重量:");
        total = input.nextInt();
        System.out.print("请输入要装入的物品个数:");
        num = input.nextInt();
        System.out.println("请输入各物品的重量:");
        weight = new Integer[num];
        store = new Integer[num];
        for (int i = 0; i < weight.length; i++) {
            weight[i] = input.nextInt();    //每个物品的重量
            store[i] = 0;                   //初始化物品都不存放
        }
    }

    /**
     * 按物品重量由小到大升序排序，同时调整物品序号
     */
    private static void weightSort() {
        Integer change = 1;
        Integer temp;
        for (int i = 0; i < weight.length - 1 && change == 1; i++) {
            change = 0;
            for (int j = 0; j < weight.length - 1 - i; j++) {
                if (weight[j] > weight[j + 1]) {
                    // 交换重量数组
                    temp = weight[j];
                    weight[j] = weight[j + 1];
                    weight[j + 1] = temp;

                    change = 1; //避免不必要的排序操作
                }
            }
        }
    }

    /**
     * 统计最优装载
     */
    private static void excellentLoading() {
        residueTotal = total;
        for (int i = 0; i < weight.length && weight[i] <= residueTotal; i++) {
            store[i] = 1;     // 轮船存放物品
            residueTotal = residueTotal - weight[i];  // 轮船剩余重量
        }
    }

    /**
     * 输出函数
     */
    private static void print() {
        System.out.println("轮船最大容量: total = " + total + "，轮船剩余容量: residueTotal = " + residueTotal);
        System.out.println("排序完物品数组: ");
        Stream.of(weight).forEach(element -> System.out.print(element + " "));
        System.out.println();
        System.out.println("物品存放数组: ");
        Stream.of(store).forEach(element -> System.out.print(element + " "));
        System.out.println();
    }

    public static void main(String[] args) {
        // 初始化数据
        initData();
        // 排序【按重量由小到大】
        weightSort();
        // 统计最优装载
        excellentLoading();
        // 输出
        print();
    }

}

请输入轮船的总重量:20
请输入要装入的物品个数:6
请输入各物品的重量:
1
4
8
6
9
3
轮船最大容量: total = 20，轮船剩余容量: residueTotal = 6
排序完物品数组: 
1 3 4 6 8 9 
物品存放数组: 
1 1 1 1 0 0