【LeetCode】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?

答案来自：

点击打开链接

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        int n = nums.size();
        int f[target + 1] = {0};
        f[0] = 1;
        for (int i = 0; i <= target; ++i) {
            if (f[i] == 0) {
                continue;
            }
            for (int j = 0; j < n; ++j) {
                int t = i + nums[j];
                if (t <= target) {
                    f[t] += f[i];
                }
            }
        }
        return f[target];
    }
};

i

思路分析：

虽然也是DP

但是自己写了一个非常暴力的递归。最后发现TLE了。后来还是决定求助discuss了

该答案的思路是这样的

首先建立一个DP的数组。

对于求和结果为0的状况下，只有一种情况使所有的数字加起来为0.

所以dp[0]=1;

然后对于每一个目标求和结果的数字n和m以及向量中的元素a[i]

则如果a[i]+n不大于m的话。

假设要求和为k有dp[k]种组合

对应每一个nums[i]，k+nums[i]就是dp[k]中的组合