受限制的硬币兑换问题python java转换

def coinChange(coins, amount):
    # 创建一个长度为amount+1的列表，用于存储每个金额所需的最少硬币数量
    dp = [float('inf')] * (amount + 1)
    dp[0] = 0  # 目标金额为0时，所需硬币数量为0

    for coin in coins:
        for i in range(coin, amount + 1):
            dp[i] = min(dp[i], dp[i - coin] + 1)

    if dp[amount] == float('inf'):
        return -1  # 无法凑出目标金额
    else:
        return dp[amount]

coins = [1, 2, 5]  # 硬币面值
amount = 11  # 目标金额
result = coinChange(coins, amount)
print(result)

public class CoinChange {
    public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];
        Arrays.fill(dp, amount + 1);
        dp[0] = 0;

        for (int coin : coins) {
            for (int i = coin; i <= amount; i++) {
                dp[i] = Math.min(dp[i], dp[i - coin] + 1);
            }
        }

        return dp[amount] > amount ? -1 : dp[amount];
    }

    public static void main(String[] args) {
        int[] coins = {1, 2, 5};
        int amount = 11;
        CoinChange cc = new CoinChange();
        int result = cc.coinChange(coins, amount);
        System.out.println(result);
    }
}