把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
思路:动态规划,可以根据有i-1个骰子的情况,求出有i个骰子的情况。dp[i][j]表示有i个骰子时,掷出点数和为j的概率。
//动态规划
vector<double> dicesProbability(int n) {
vector<vector<double>>dp(n+1,vector<double>(6*n+1));
for (int i = 1; i <= 6; i++) {
dp[1][i] = 1.0/6.0;
}
for (int i = 2; i <= n; i++) {
for (int j = i; j <= 6*i; j++) {
for (int cur = 1; cur <= 6; cur++) {
if (j - cur < i-1) {//前一个状态有i-i个骰子,最小的点数为i-1
break;
}
dp[i][j] += dp[i-1][j-cur]/6.0;//除以6.0,因为每个点数的概率为1/6
}
}
}
vector<double> ret;
for (int i = n; i <= 6 * n; i++) {
ret.push_back(dp[n][i]);
}
return ret;
}
//由于只与前一个状态有关,可以对空间进行优化
vector<double> dicesProbability(int n) {
vector<double>dp(6*n+1);
for (int i = 1; i <= 6; i++) {
dp[i] = 1.0/6.0;
}
for (int i = 2; i <= n; i++) {
for (int j = 6*i; j >= i; j--) {
dp[j]=0;
for (int cur = 1; cur <= 6; cur++) {
if (j - cur < i-1) {
break;
}
dp[j] += dp[j-cur]/6.0;
}
}
}
vector<double> ret;
for (int i = n; i <= 6 * n; i++) {
ret.push_back(dp[i]);
}
return ret;
}
//用两个数组来做,一个保存前一个状态,一个保存当前状态
vector<double> dicesProbability(int n) {
vector<double> dp(6, 1.0 / 6.0);
for (int i = 2; i <= n; i++) {
vector<double> tmp(5 * i + 1, 0);//点数和的范围:i~i*6 所以需要更新的状态有5*i+1个
for (int j = 0; j < dp.size(); j++) {
for (int k = 0; k < 6; k++) {
tmp[j + k] += dp[j] / 6.0;
}
}
dp = tmp;
}
return dp;
}