LeetCode377. Combination Sum IV

最新推荐文章于 2022-12-16 17:16:39 发布

mohk

最新推荐文章于 2022-12-16 17:16:39 发布

阅读量266

点赞数

分类专栏： leetcode 文章标签： c++ leetcode 动态规划

本文链接：https://blog.csdn.net/mohuak/article/details/78573949

版权

leetcode 专栏收录该内容

51 篇文章 1 订阅

订阅专栏

LeetCode377. 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?

题意分析：这道题并没有和前面的几道题一样，而是选择yoga动态规划去解决。

comb[target] = sum(comb[target - nums[i]]), where 0 <= i < nums.length, and target >= nums[i].

代码：

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