leetcode-518

class Solution {
public:
    int change(int amount, vector<int>& coins) {
        int dim1 = coins.size();
        int dim2 = amount+1;
        int dp[dim2];
        // dp[0]=1;
        for(int i=0;i<dim2;i++) dp[i]=(i==0)?1:(0);
 
        for(int i=0;i<dim1;i++)
        {
            for(int j=coins[i];j<dim2;j++) 
            {
                  dp[j]+=dp[j-coins[i]];
            }
        }
        return dp[dim2-1];
    }
};