n个骰子的点数

n个骰子的点数

题目:

把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n(1 <= n <= 11)，打印出s的所有可能的值出现的概率。

你需要用一个浮点数数组返回答案，其中第 i 个元素代表这 n 个骰子所能掷出的点数集合中第 i 小的那个的概率。

示例 1:
输入: 1
输出: [0.16667,0.16667,0.16667,0.16667,0.16667,0.16667]

示例 2:
输入: 2
输出: [0.02778,0.05556,0.08333,0.11111,0.13889,0.16667,0.13889,0.11111,0.08333,0.05556,0.02778]

解题思路: 通过dp将 n 个骰子 投掷出的点数次数 记录下来, 之后进行计算即可

class Solution {

    private static int dp[][] = new int[12][70];

    static {
        for(int i = 1; i <= 6; i++) {
            dp[1][i] = 1;
        }

        for(int i = 2; i <= 11; i++) {
            for(int j = i; j <= i * 6; j++) {
                for(int k = 1; k <= 6; k++) {
                    if(j >= k) {
                        dp[i][j] += dp[i - 1][j - k];
                    }
                }
            }
        }
    }

    public double[] dicesProbability(int n) {

        double all = Math.pow(6, n);
        double[] ans = new double[n * 5 + 1];
        int cur = 0;
        for(int i = n; i <= 6 * n; i++) {
            ans[cur++] = dp[n][i] / all;
        }

        return ans;
    }
}