如何用算法计算多件商品的最佳优惠方案？

const compute = (goods = []) => {
  // 初始化
  const discountgoodsmap = new map();
  let total = 0;
  for (let good of goods) {
    // 计算每个商品的原始总价和折扣后总价
    good.totalprice = good.price * good.num;
    good.totaldisprice = good.totalprice;

    // 记录每个商品的满减优惠信息
    const spcelist = good.spcelist;
    spcelist.foreach(id => {
      let spce = tb_spce.find(s => s.id === id);
      if (spce.type === "折扣" && good.num >= spce.full) {
        // 打折
        good.totaldisprice = math.min(good.totaldisprice, good.totalprice * spce.reduction);
      } else if (spce.type === "满减") {
        // 记录满减优惠
        let gs = discountgoodsmap.get(spce);
        if (!gs) {
          gs = [];
          discountgoodsmap.set(spce, gs);
        }
        gs.push(good);
      }
    });
    total += good.totaldisprice;
  }

  // 找出所有满减优惠组合
  const compose = [];
  discountgoodsmap.foreach((v, k) => {
    discomposebacktrace(0, v, k.full, k.reduction, [], compose, k.id);
  });

  // 回溯法遍历所有满减优惠组合，寻找最优解
  const res = { total: total, discount: 0, compose: [] };
  composebacktrace(0, compose, [], new set(), res, 0);

  // 计算最终折扣后的总价
  res.total = res.total - res.discount;

  return res;
};

{
  "total": 93.1,
  "discount": 11,
  "compose": [
    [
      [1, 6, 28.5, 102],
      [2, 6, 25.2, 102]
    ],
    [[4, 5, 33.6, 104]]
  ]
}