프로그래머스-거스름돈

class Solution {
    public int solution(int n, int[] money) {
        int[] d = new int[n+1];
        d[0] = 1;
        
        for(int i=0; i<money.length; i++)
        	for(int j=1; j<=n; j++)
        		if(j-money[i] >= 0)
        			d[j] += d[j-money[i]];
    	
        return d[n];
    }
}