前言: 书上的解释太简单了,在此补充解释下。
思路: 利用动态规划,不断地迭代即可。动态规划的公式为:
dp[i][j] = dp[i-1][j-1] + dp[i-1][j-2] + dp[i-1][j-3] + dp[i-1][j-4] + dp[i-1][j-5] + dp[i-1][j-6]。
例:假设有5个骰子,具体计算如下。
实际上只需要两行的空间(2个长度为30的数组)交替运算就可以,这便是书中的算法。
代码实现:
#include <iostream>
#include <assert.h>
#include <vector>
using namespace std;
void PrintProbability(int number) {
if (number < 1) return;
int *pProbabilities[2];
pProbabilities[0] = new int[6 * number + 1];
pProbabilities[1] = new int[6 * number + 1];
for (int i = 0; i < 6 * number + 1; ++i) { // 全部置零
pProbabilities[0][i] = 0;
pProbabilities[1][i] = 0;
}
int flag = 0;
for (int i = 1; i <= 6; ++i) {
pProbabilities[flag][i] = 1;
}
for (int k = 2; k <= number; ++k) { // 骰子个数
//for (int i = 0; i < k; ++i)
//pProbabilities[1 - flag][i] = 0;
for (int i = k; i <= 6 * number; ++i) {
pProbabilities[1 - flag][i] = 0;
for (int j = 1; j <= i && j <= 6; ++j) {
if (i-j >= k-1) // 此行代码可取代上面注释的两行代码
pProbabilities[1 - flag][i] += pProbabilities[flag][i - j];
}
}
flag = 1 - flag;
}
//double total = pow((double)6, number);
for (int i = number; i <= 6 * number; ++i) {
double ratio = (double)pProbabilities[flag][i] / total;
printf("%d: %d\n", i, pProbabilities[flag][i]);
}
putchar(10);
delete[] pProbabilities[0];
delete[] pProbabilities[1];
}
int main() {
PrintProbability(5);
system("pause");
}
参考:https://www.cnblogs.com/wangkundentisy/p/9378886.html