编辑代码

public class CoinCollection {
    public static int maxCoinCollection(int[] coins, int capacity) {
        int n = coins.length;
        int[][] dp = new int[n + 1][capacity + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= capacity; j++) {
                if (j >= coins[i - 1]) {
                    dp[i][j] = Math.max(dp[i - 1][j - coins[i - 1]] + coins[i - 1], dp[i - 1][j]);
                } else {
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        
        return dp[n][capacity];
    }

    public static void main(String[] args) {
        int[] coins = {1, 2, 5};
        int capacity = 8;
        int maxCoin = maxCoinCollection(coins, capacity);
        System.out.println("最优解: " + maxCoin);
    }
}