卡车装货问题是不是可以用深搜的算法才能解决呢

public class TruckLoading {
    private int maxWeight; // 卡车的最大容量
    private int numItems; // 货物的数量
    private int[] items; // 货物的重量
    private int maxLoadedWeight; // 最大装载重量
    private boolean[] loadedItems; // 已经装载的货物

    public TruckLoading(int maxWeight, int[] items) {
        this.maxWeight = maxWeight;
        this.numItems = items.length;
        this.items = items;
        this.maxLoadedWeight = 0;
        this.loadedItems = new boolean[numItems];
    }

    public void findMaxLoad() {
        findMaxLoadHelper(0, 0);
    }

    private void findMaxLoadHelper(int index, int currentWeight) {
        // 更新最大装载重量
        maxLoadedWeight = Math.max(maxLoadedWeight, currentWeight);

        // 如果当前重量已经达到卡车的最大容量，则返回
        if (currentWeight == maxWeight) {
            return;
        }

        // 从当前货物开始尝试装载
        for (int i = index; i < numItems; i++) {
            // 如果当前货物没有被装载过，并且当前货物重量加上已经装载的重量不超过卡车的最大容量，则装载它
            if (!loadedItems[i] && currentWeight + items[i] <= maxWeight) {
                loadedItems[i] = true;
                findMaxLoadHelper(i + 1, currentWeight + items[i]); // 继续进行下一个货物的尝试
                loadedItems[i] = false;  // 回溯，重置该货物的装载状态
            }
        }
    }

    public int getMaxLoadedWeight() {
        return maxLoadedWeight;
    }

    public static void main(String[] args) {
        int maxWeight = 10;
        int[] items = {2, 3, 4, 5};
        TruckLoading truckLoading = new TruckLoading(maxWeight, items);
        truckLoading.findMaxLoad();
        System.out.println("最大装载重量为：" + truckLoading.getMaxLoadedWeight());
    }
}