题目
把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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解
回溯
class Solution {
public void backtracing(int i, int n, int sum, double[] ans){
if(i==n){
ans[sum-n]++;
return;
}
for(int j=1;j<=6;j++){
backtracing(i+1,n,sum+j,ans);
}
}
public double[] dicesProbability(int n) {
double[] ans = new double[5*n+1];
backtracing(0,n,0,ans);
for(int i=0;i<ans.length;i++){
ans[i] = 1.0*ans[i]/Math.pow(6,n);
}
return ans;
}
}