【剑指offer刷题笔记】60.n个骰子的点数

剑指No.60_n个骰子的点数

• 题目：把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n，打印出s的所有可能的值出现的概率。
  你需要用一个浮点数数组返回答案，其中第 i 个元素代表这 n 个骰子所能掷出的点数集合中第 i 小的那个的概率。

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

• 动态规划
  

    public double[] dicesProbabilityWay(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;
    }