LeetCode 322. 零钱兑换(彻底背包问题（DP）或DFS)

dp解法：web class Solution { public: int dp[1000000]; int coinChange(vector<int>& coins, int amount) { for(int i=1;i<=amount;i++){ dp[i]=2000000000; for(auto m:coi

>>阅读原文<<