摘要： class Solution { public int[] packing(int n, int m, int[] a, int[][] bomm){ int[] max = new int[m]; //计算每个bom最多装几个 for (int i = 0; i = max.length){ if (best(... 阅读全文