377 Combination Sum IV

1 题目

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.

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?

2 尝试解

2.1 分析

最初的想法是用回溯法，找出所有可能的组成方法（有序），即每次添加时都在Nums里从头遍历，结果不出所料时间超时了。考虑找出所有可能的组成方法（无序），即每次添加时，限制新加入的元素不能比上一个加入的元素小，从而去重，然后对每一种情况，考虑其排列组合。但是排列组合函数实现起来有点麻烦，最终放弃。

在试验前几个数的情况下，发现F(n) = Sum(F(n - num) for num in nums && num <= n)，即与求找零钱的所有情况（无序）相同。

2.2 代码

class Solution {
public:
    map<int,int> record;
    int combinationSum4(vector<int>& nums, int target) {
        record[0] = 1;
        return find(nums,target);
    }
    int find(vector<int>& nums,int target){
        if(record.count(target) != 0) return record[target];
        for(auto coin:nums){
            if(target >= coin)
                record[target] += find(nums,target-coin);
        }
        return record[target];
    }
};

3 标准解

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        vector<unsigned int> result(target + 1);
        result[0] = 1;
        for (int i = 1; i <= target; ++i) {
            for (int x : nums) {
                if (i >= x) result[i] += result[i - x];
            }
        }
        
        return result[target];
    }
};