Day44(518, 377)

最新推荐文章于 2024-10-14 18:52:56 发布

MicroYui

最新推荐文章于 2024-10-14 18:52:56 发布

阅读量506

点赞数

分类专栏： leetcode刷题文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/HITyingcai/article/details/129921727

版权

leetcode刷题专栏收录该内容

51 篇文章 0 订阅

订阅专栏

文章介绍了两道动态规划问题的解决方案，CoinChangeII是关于不同面额硬币组成指定金额的组合数，CombinationSumIV则是找到数组中数字组合成目标值的计数。两个问题都使用了自底向上的动态规划方法，通过遍历硬币面额和目标值，计算出所有可能的组合方式。

摘要由CSDN通过智能技术生成

518. Coin Change II

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0.

You may assume that you have an infinite number of each kind of coin.

The answer is guaranteed to fit into a signed 32-bit integer.

Example 1:

Input: amount = 5, coins = [1,2,5]
Output: 4
Explanation: there are four ways to make up the amount:
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1

Example 2:

Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.

Example 3:

Input: amount = 10, coins = [10]
Output: 1

class Solution {  
    public int change(int amount, int[] coins) {  
        int[] dp = new int[amount + 1]; dp[0] = 1;  
        for (int i = 0; i < coins.length; i++) {  
            for (int j = coins[i]; j <= amount; j++) {  
                dp[j] += dp[j - coins[i]];  
            }  
        }  
        return dp[amount];  
    }  
}

377. Combination Sum IV

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.

The test cases are generated so that the answer can fit in a 32-bit integer.

Example 1:

Input: nums = [1,2,3], target = 4
Output: 7
Explanation:
The possible combination ways are:
(1, 1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(1, 3)
(2, 1, 1)
(2, 2)
(3, 1)
Note that different sequences are counted as different combinations.

Example 2:

Input: nums = [9], target = 3
Output: 0

class Solution {  
    public int combinationSum4(int[] nums, int target) {  
        int[] dp = new int[target + 1];  
        dp[0] = 1;  
        for (int i = 0; i <= target; i++) {  
            for (int j = 0; j < nums.length; j++) {  
                if (i >= nums[j]) {  
                    dp[i] += dp[i - nums[j]];  
                }  
            }  
        }  
        return dp[target];  
    }  
}