用java并使用回溯法解决下列问题：设有一小货轮载重量为30，待装集装箱有8个，其重量分别为{4,10,7,11,3,5,14,2}，问最多能装入的集装箱数量

以下是基于回溯法的Java实现：

public class Container {
    private int[] weights; // 集装箱重量数组
    private int capacity; // 载重量
    private int maxCount; // 最多能装入的集装箱数量

    public Container(int[] weights, int capacity) {
        this.weights = weights;
        this.capacity = capacity;
        this.maxCount = 0;
    }

    public void backtrack(int pathLen, int weight) {
        if (weight <= capacity && pathLen > maxCount) {
            // 如果当前方案比已知最优解更优，更新最优解
            maxCount = pathLen;
        }

        for (int i = pathLen; i < weights.length; i++) {
            if (weight + weights[i] <= capacity) {
                backtrack(pathLen + 1, weight + weights[i]);
            }
        }
    }

    public int solve() {
        backtrack(0, 0);
        return maxCount;
    }
}

使用示例：

int[] weights = {4, 10, 7, 11, 3, 5, 14, 2};
int capacity = 30;
Container container = new Container(weights, capacity);
int maxCount = container.solve();
System.out.println(maxCount);

输出结果为：

4

表示最多能装入4个集装箱，重量为4+10+7+11=32，超出载重量。