动态规划解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.

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.

题意分析

题目意思是说给定一数组，求里面的数加起来能组合成目标数的个数。比如给定一数组[1，2，3]，目标数为4，那么能组合成目标数的形式为(1, 1, 1, 1)，(1, 1, 2)，(1, 2, 1)，(1, 3)，(2, 1, 1)，(2, 2)，(3, 1)。总共有7种，因此程序需要返回7。

思路分析

这是一道动态规划题目。我们可以设置一个数组F，从0开始遍历到target，F[i]表示目标数为i时，给定的数组能组合成该目标数的个数，那么就可以得到递推式:

F[i] = F[i]+F[i-nums[j]](j从0到nums.size()-1且i ≥ nums[j]) 算法复杂度为o(n^2)

AC代码

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        int* p = new int[target+1];
        for (int i = 0; i <= target; ++i) p[i] = 0;
        p[0] = 1;
        for (int i = 0; i <= target; ++i) {
            for (int j = 0; j < nums.size(); ++j) {
                if (i - nums[j] >= 0) {
                    p[i] = p[i] + p[i - nums[j]];
                }
            }
        }
        return p[target];
    }
};