https://leetcode-cn.com/problems/combination-sum-iv/
思路:dp
int combinationSum4(vector<int>& nums, int target) {
vector<unsigned long long> dp(target + 1, 0);
dp[0] = 1;
for (int i = 0; i <= target; i++) {
for (int j = 0; j < nums.size(); j++) {
if (nums[j] <= i) {
dp[i] = dp[i] + dp[i - nums[j]];
}
}
//cout << i << " " << dp[i] << endl;
}
return dp[target];
}