题目描述
方法:
动态规划,n个骰子看做n-1个的结果加上一个的结果
n个骰子有5n+1个结果
f(n,x) = sum(i=[1,6]) f(n-1,x-i)/6
f(n-1)中x=2对 f(n)中x=3,4,5,6,7,8有影响
class Solution:
def dicesProbability(self, n: int) -> List[float]:
dp = [1/6]*6
for k in range(1, n):
tmp = [0] * (5*k+6)
for i in range(len(dp)):
for j in range(6):
tmp[i+j] += dp[i] / 6
dp = tmp
return dp