![在这里插入图片描述](https://img-blog.csdnimg.cn/20210312164041915.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0FtYmVyZmQ=,size_16,color_FFFFFF,t_70)
解法一
动态规划,每多一位n多进行一轮
class Solution {
public:
vector<double> dicesProbability(int n) {
vector<double> dp(6,1.0/6.0);
for (int i = 2; i <= n; i++)
{
vector<double> temp(5*i+1,0);
for (int j = 0; j < dp.size(); j++)
{
for (int k = 0; k < 6; k++)
{
temp[j+k]+=dp[j]/6.0;
}
}
dp = temp;
}
return dp;
}
};