最优装载问题

private static void load_problem(int[] weight, int c) {
    int number = weight.length;     // 商品数量
    int[] tempWeight = weight;      // 临时数组用于排序
    int currentSpace = c;           // 剩余空间

    // 冒泡排序：从小到大排序
    for (int i = 0; i < number; i++) {
        for (int j = i + 1; j < number; j++) {
            if (tempWeight[i] > tempWeight[j]) {
                tempWeight[i] = tempWeight[i] + tempWeight[j];
                tempWeight[j] = tempWeight[i] - tempWeight[j];
                tempWeight[i] = tempWeight[i] - tempWeight[j];
            }
        }   // end inner for
    }   // end outer for

    System.out.println("装载物品如下：");
    // 贪心选择装载
    for (int i = 0; i < number; i++) {
        if (tempWeight[i] > currentSpace) break;

        currentSpace -= tempWeight[i];
        System.out.printf("重量为：%2d\n", tempWeight[i]);
    }
}