377. Combination Sum IV
0 CommentsGiven 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:
|
|
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?
Ref时讲的很详细, 转化公式为: comb[target] = sum(comb[target - nums[i]]), where 0 <= i < nums.length, and target >= nums[i]
|
|
Ref: https://discuss.leetcode.com/topic/52302/1ms-java-dp-solution-with-detailed-explanation