You are given N boxes and M objects. Each box has a capacity n(i), stored in a list. Each object has a volume m(i), stored in a list. Design a packing solution that packs as many items as possible. Moreover, if there are multiple solutions, waste as little space as possible. Return a list where l(i) stores the corresponding box to be packed inside. If object i cannot be packed, set l(i) as -1.
演算法新手，實在沒有什么思路，希望大佬們能指點指點
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/62208.html
標籤：數據結構與算法
上一篇：Python中的selenium的send_keys中的內容可以弄成回圈嗎？
下一篇：gprmax2.0 3D成像方面