322. 零钱兑换

最新推荐文章于 2024-08-28 16:03:48 发布

void1024

最新推荐文章于 2024-08-28 16:03:48 发布

阅读量108

点赞数 2

分类专栏：面试经典 150 题文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/diOSyu/article/details/140310299

版权

面试经典 150 题专栏收录该内容

132 篇文章 1 订阅

订阅专栏

class Solution {
    public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];
        int INT_MAX = amount + 1;
        for (int i = 1; i < dp.length; i++) {
            dp[i] = INT_MAX;
            for (int coin : coins) {
                if (i - coin > -1 && dp[i - coin] != -1) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }
        if (dp[amount] > amount) {
            return -1;
        }
        return dp[amount];
    }
}

class Solution {
    public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];
        for (int i = 1; i < dp.length; i++) {
            int minDj = -1;
            for (int coin : coins) {
                if (i - coin > -1 && dp[i - coin] != -1) {
                    if (minDj == -1) {
                        minDj = dp[i - coin];
                    } else {
                        minDj = Math.min(minDj, dp[i - coin]);
                    }
                }
            }
            if (minDj == -1) {
                dp[i] = -1;
            } else {
                dp[i] = minDj + 1;
            }
        }
        return dp[amount];
    }
}