中国最大网站排名_自制app软件的软件_北京百度seo关键词优化_长尾关键词排名系统

题目：

题解：

class Solution {
public:int change(int amount, vector<int>& coins) {vector<int> dp(amount + 1), valid(amount + 1);dp[0] = 1;valid[0] = 1;for (int& coin : coins) {for (int i = coin; i <= amount; i++) {valid[i] |= valid[i - coin];}}if (!valid[amount])return 0;for (int& coin : coins) {for (int i = coin; i <= amount; i++) {dp[i] += dp[i - coin];}}return dp[amount];}
};