题目链接
![在这里插入图片描述](https://i-blog.csdnimg.cn/direct/6ddedbadc43c4112aa76c998fbf428c7.png)
动态规划
class Solution {
public int combinationSum4(int[] nums, int target) {
int[] dp = new int[target + 1];
dp[0] = 1;
for(int i = 0; i <= target; i++){
for(int j = 0; j < nums.length; j++){
if(i >= nums[j]){
dp[i] += dp[i - nums[j]];
}
}
}
return dp[target];
}
}