LeetCode(剑指 Offer)- 60. n个骰子的点数

MaxWen

关注

阅读 50

2022-05-18


题目链接:​​点击打开链接​​

题目大意:

解题思路

LeetCode(剑指 Offer)- 60. n个骰子的点数_60. n个骰子的点数

相关企业

  • 字节跳动

AC 代码

  • Java
class Solution {
public double[] dicesProbability(int n) {
double[] dp = new double[6];
Arrays.fill(dp, 1.0 / 6.0);
for (int i = 2; i <= n; i++) {
double[] tmp = new double[5 * i + 1];
for (int j = 0; j < dp.length; j++) {
for (int k = 0; k < 6; k++) {
tmp[j + k] += dp[j] / 6.0;
}
}
dp = tmp;
}
return dp;
}
}
  • C++
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> tmp(5 * i + 1, 0);
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;
}
};


精彩评论(0)

0 0 举报