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

目录结构

1.题目

2.题解

---

1.题目

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

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

示例：

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

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

限制：

• 1 <= n <= 11

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2.题解

类似于枚举所有可能出现的情况，并分别计算概率。

public class Offer60 {

    @Test
    public void test() {
        System.out.println(Arrays.toString(dicesProbability(2)));
    }

    public double[] dicesProbability(int n) {
        double[] pre = new double[]{1 / 6d, 1 / 6d, 1 / 6d, 1 / 6d, 1 / 6d, 1 / 6d};
        for (int i = 2; i <= n; i++) {
            double[] tmp = new double[5 * i + 1];
            for (int j = 0; j < pre.length; j++) {
                for (int k = 0; k < 6; k++) {
                    tmp[j + k] += pre[j] / 6d;
                }
            }
            pre = tmp;
        }
        return pre;
    }

    public double[] dicesProbability1(int n) {
        Map<Integer, Integer> pre;
        Map<Integer, Integer> cur = new HashMap<>();
        for (int i = 1; i <= 6; i++) {
            cur.put(i, 1);
        }
        for (int i = 1; i < n; i++) {
            pre = cur;
            cur = new HashMap<>();
            for (int t : pre.keySet()) {
                int count = pre.get(t);
                for (int j = 1; j <= 6; j++) {
                    cur.put(t + j, cur.getOrDefault(t + j, 0) + count);
                }
            }
        }
        double[] result = new double[cur.size()];
        int base = (int) Math.pow(6, n);
        for (int i = 0; i < cur.size(); i++) {
            result[i] = 1.0 * cur.get(n + i) / base;
        }
        return result;
    }
}