leetcode

0 class Solution {

1 public:

2 int combinationSum4(vector<int> &nums, int target) {

3 vector<long long> dp(target + 1, 0);

4 dp[0] = 1;

5

6 for (int i = 1; i <= target; i++)

7 for (int num : nums)

8 if (i - num >= 0) dp[i] = (dp[i] + dp[i - num]) % INT_MAX;

9

10 return dp.back();

11 }

12 };