一、题目
把n个骰子扔在地上,所有骰子朝上一面的点数之和为s。输入n,打印出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]
限制:
1 <= n <= 11
二、解决
1、动态规划—方法1
思路:
1、状态定义
sum[]:n个骰子投掷后的点数概率数组。
pre[]:n-1个骰子点数概率数组。
2、转移方程
sum[x+y] += pre[x]*num[y].
3、初始化dp数组
pre[i] = 1/6d, 1<=i<=6
代码:
class Solution {
public double[] dicesProbability(int n) {