剑指Offer——面试题60：n个骰子的点数

面试题60：n个骰子的点数

题目：把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n，打印出s的所有可能的值出现的概率。

🐱‍🏍解法一：基于递归求骰子点数，时间效率不够高

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int g_maxValue=6;
void Probability(int original, int current, int sum, int* pProbabilites){
	if(current==1){
		pProbabilites[sum-original]++;
	}else{
		for(int i=1;i<=g_maxValue;i++){
			Probability(original, current-1, i+sum, pProbabilites);
		}
	}
}
void Probability(int number, int* pProbabilites){
	for(int i=1;i<=g_maxValue;i++){
		Probability(number, number, i, pProbabilites);
	}
}
void PrintProbability(int number){
	if(number<1) return ;
	
	int maxSum=number*g_maxValue;
	int* pProbabilities=new int[maxSum-number+1];
	for(int i=number;i<=maxSum;i++){
		pProbabilities[i-number]=0;
	}
	
	Probability(number, pProbabilities);
	
	int total=pow(g_maxValue, number);
	for(int i=number;i<=maxSum;i++){
		double ratio=(double)pProbabilities[i-number]/total;
		printf("%d: %e\n", i, ratio);
	}
	delete[] pProbabilities;
}
int main() {
	PrintProbability(10);
	return 0;
}

🐱‍🏍解法二：基于循环求骰子点数，时间性能好

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int g_maxValue=6;
void PrintProbability(int number){
	if(number<1) return;
	
	int* pProbabilities[2];
	pProbabilities[0]=new int[g_maxValue*number+1];
	pProbabilities[1]=new int[g_maxValue*number+1];
	for(int i=0;i<g_maxValue*number+1;i++){
		pProbabilities[0][i]=0;
		pProbabilities[1][i]=0;
	}
	int flag=0;
	for(int i=1;i<=g_maxValue;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<=g_maxValue*k;i++){
			pProbabilities[1-flag][i]=0;
			
			for(int j=1;j<=i && j<=g_maxValue;j++){
				pProbabilities[1-flag][i]+=pProbabilities[flag][i-j];
			}
		}
		flag=1-flag;
	}
	
	double total=pow(g_maxValue, number);
	for(int i=number;i<=g_maxValue*number;i++){
		double ratio=(double)pProbabilities[flag][i]/total;
		printf("%d: %e\n", i, ratio);
	}
	delete[] pProbabilities[0];
	delete[] pProbabilities[1];
}
int main() {
	PrintProbability(10);
	return 0;
}