【LeetCode】剑指 Offer 60. n个骰子的点数

【LeetCode】剑指 Offer 60. n个骰子的点数

package offer;

import java.util.Arrays;

public class Solution60 {
    public static void main(String[] args) {
        int n = 2;
        Solution60 solution = new Solution60();
        System.out.println(Arrays.toString(solution.method(n)));
    }

    private double[] method(int n){
        double[] dp = new double[6];
        Arrays.fill(dp,1.0/6.0);
        for(int i = 2; i <= n; i++){
            double[] temp = new double[5 * i + 1];
            for(int j = 0; j < dp.length; j++){
                for(int k = 0; k < 6; k++){
                    temp[j + k ] += dp[j] / 6.0;
                }
            }
            dp = temp;
        }
        return dp;
    }
}

//时间复杂度为 O(n^2)
//空间复杂度为 O(n)