[leetcode 377. Combination Sum IV]medium|week10

一、题目

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.

Subscribe to see which companies asked this question.

二、思路

典型的动态规划题目，动态数组dp[i]含义为将若干个数相加为i有多少种方法。两重循环遍历数组，递推式子是dp[i]=dp[i]+dp[i-num是[j]],
遍历过程中更新dp数组，从而得到最终想要的结果。

三、代码

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        int *dp=new int[target+1];//dp[i]表示将若干数加成i有几种方法 

        for(int i=0;i<target+1;i++)
        dp[i]=0;
        dp[0]=1; //当number = i 时 ，dp[i]+=dp[0],因此需要初始化为1
        for(int i=1;i<=target;i++){
            for(int j=0;j<nums.size();j++){
                int number = nums[j];
                if(number<=i)dp[i]+=dp[i-number];
            }
        } 

        return dp[target]; 
    }
};