装箱问题：在装箱问题中，有若干个容量为c 的箱子和n 个待装载入箱子中的物品。物品i 需占

用s[i]个单元（0< s[i]≤c）。成功装载是指能把所有物品都装入箱子。最优装载是指使用最

少箱子的成功装载。

例如某运输公司要把包裹装入卡车中，每个包裹都有一定的重量，且每辆卡车也有其载

重限制（假设每辆卡车的载重都一样）。在卡车装载问题中，希望用最少的卡车来装载包裹。

此问题可看作装箱问题。卡车对应于箱子，包裹对应于物品。

解装箱问题的Best Fit 算法：

设avail[i]为箱子i 的可用容量。

初始时，所有箱子的可用容量为c 。

选择物品i放入具有最小avail且容量大于s[i]的箱子中。-packing problem : packing problems, there are a number of the capacity of the c-and n boxes to be loaded into the boxes of goods. I goods occupied s [i] units (0lt; S [i]　c). Success is able to carry all of the items are put into boxes. The optimal loading refers to the use of the boxes at least the successful loading. For example, should a transportation company trucks loaded packages, each package has a certain weight, and each has its truck load restrictions (on the assumption that each truck load are the same). The truck loaded question, in the hope that at least a truck loaded parcels. This issue can be seen as packing problems. Truck corresponding to the boxes, parcels corresponding to the items. Xie crates of Best Fit is : Let avail [i] i boxes available capacity. Initially, all th