【LeetCode】377. Combination Sum IV 组合总和 Ⅳ(Medium)(JAVA)
题目地址: https://leetcode.com/problems/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?
Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.
题目大意
给定一个由正整数组成且不存在重复数字的数组,找出和为给定目标正整数的组合的个数。
进阶:
如果给定的数组中含有负数会怎么样?
问题会产生什么变化?
我们需要在题目中添加什么限制来允许负数的出现?
解题方法
- 这一题和 coins 那题比较类似,给一些领钱,看有多少种兑换方式
- 采用动态规划,函数 dp[i] 表示,和为 i 的话有多少总算法
- 如何计算 dp[i]? 可以遍历 nums 数组,加上 dp[i - nums[j]] 的算法也就是: dp[i] += dp[i - nums[j]]
class Solution {
public int combinationSum4(int[] nums, int target) {
Arrays.sort(nums);
int[] dp = new int[target + 1];
dp[0] = 1;
for (int i = 1; i <= target; i++) {
for (int j = 0; j < nums.length && nums[j] <= i; j++) {
dp[i] += dp[i - nums[j]];
}
}
return dp[target];
}
}
执行耗时:2 ms,击败了36.87% 的Java用户
内存消耗:35.6 MB,击败了88.05% 的Java用户