【leetcode】【medium】377. Combination Sum IV

最新推荐文章于 2024-07-31 14:55:50 发布

原创最新推荐文章于 2024-07-31 14:55:50 发布 · 141 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

code 同时被 2 个专栏收录

233 篇文章

订阅专栏

c++

230 篇文章

订阅专栏

本文解析了LeetCode上的第377题Combination Sum IV，探讨了如何使用动态规划方法来解决给定正整数数组中，所有可能组合的数量，这些组合相加等于目标正整数。文章提供了详细的代码实现和注意事项，如int溢出问题的处理。

377. Combination Sum IV

Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.

Example:

nums = [1, 2, 3]
target = 4

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.

Therefore the output is 7.

Follow up:
What if negative numbers are allowed in the given array?
How does it change the problem?
What limitation we need to add to the question to allow negative numbers?

Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.

题目链接：https://leetcode-cn.com/problems/combination-sum-iv/

思路

DP。

和找零钱的题目方法一样，只不过找零钱记录的是零钱数量，这道题记录的是组合数量。

！注意这题会有int溢出的问题，long long也不行，需要用unsigned long long。

typedef unsigned long long ull;
class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        int len = nums.size();
        if(len==0 || target<=0) return 0;
        ull rec[target+1] = {1};
        for(int i=1; i<=target; ++i){
            for(int j=0; j<len; ++j){
                if(nums[j]>i) continue;
                rec[i] += rec[i-nums[j]];
            }
        }
        return rec[target];
    }
};

系列题有很多，先不总结了，之后慢慢做。