leetcode

0 class Solution {

1 public:

2 int change(int amount, vector<int> &coins) {

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

4 dp[0] = 1;

5

6 for (int coin : coins)

7 for (int i = 0; i <= amount; i++)

8 if (i - coin >= 0) dp[i] += dp[i - coin];

9

10 return (int)dp.back();

11 }

12 };