Medium 377题 Combination Sum IV

Question:

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?

Solution:

public class Solution {
    public int combinationSum4(int[] nums, int target) {
        Arrays.sort(nums);
        int[] dp = new int[target + 1]; //dp[target] means the solution when the sum is target!
        for(int i=0;i<=target;i++)
        {
            for(int j=0;j<=nums.length-1;j++)
            {
                if(i==nums[j])//we find the solution!
                    dp[i]=dp[i]+1;
                else if(i<nums[j])
                    break;
                else if(i>nums[j])
                    dp[i]=dp[i]+dp[i-nums[j]]; //we will choose nums[j],and calculate the rest.
            }
        }
        return dp[target];
    }
}