프로그래머스 구슬을 나누는 경우의 수 (JAVA)

https://school.programmers.co.kr/learn/courses/30/lessons/120840

프로그래머스

 

 

 

class Solution {
    private static final int SIZE = 30;
    public int solution(int balls, int share) {
        int answer = 0;
        int[][] dp = new int[SIZE+1][SIZE+1];
        answer = cal(balls,share,dp);
        return answer;
    }
    private int cal(int balls,int share, int[][] dp){
        if(dp[balls][share] != 0){
            return dp[balls][share];
        }
        if(balls == share || share == 0){
            return 1;
        }else{
            return dp[balls][share] = cal(balls-1,share-1,dp) + cal(balls-1,share,dp);
        }
    }
}