题目地址:
https://www.lintcode.com/problem/dices-sum/description
给定 n n n个骰子,向上的面的数字和为 S S S,要求列出所有 S S S可能的取值以及概率。按 S S S从小到大排列。
思路是动态规划。设 f [ i ] [ j ] f[i][j] f[i][j]是只投下标为 0 ∼ i 0\sim i 0∼i的骰子的情况下,向上的面的数字和为 j j j的概率。那么有 f [ i ] [ j ] = 1 6 ∑ k = 1 6 f [ i − 1 ] [ j − k ] f[i][j]=\frac{1}{6}\sum_{k=1}^{6}f[i-1][j-k] f[i][j]=61k=1∑6f[i−1][j−k]初始条件 f [ 0 ] [ j ] = 1 6 , j = 1 , 2 , . . . , 6 f[0][j]=\frac{1}{6},j=1,2,...,6 f[0][j]=61,j=1,2,...,6。代码如下:
import java.util.AbstractMap;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
public class Solution {
/**
* @param n an integer
* @return a list of Map.Entry<sum, probability>
*/
public List<Map.Entry<Integer, Double>> dicesSum(int n) {
// Write your code here
// Ps. new AbstractMap.SimpleEntry<Integer, Double>(sum, pro)
// to create the pair
List<Map.Entry<Integer, Double>> res = new ArrayList<>();
double[][] dp = new double[n][6 * n + 1];
for (int i = 1; i <= 6; i++) {
dp[0][i] = 1.0 / 6;
}
for (int i = 1; i < n; i++) {
// 枚举可能得到的和,范围是i + 1到6 * (i + 1)
for (int j = i + 1; j <= 6 * (i + 1); j++) {
for (int k = 1; k <= 6; k++) {
if (j > k) {
dp[i][j] += dp[i - 1][j - k];
}
}
dp[i][j] /= 6.0;
}
}
for (int i = n; i <= 6 * n; i++) {
res.add(new AbstractMap.SimpleEntry<>(i, dp[n - 1][i]));
}
return res;
}
}
时空复杂度 O ( n 2 ) O(n^2) O(n2)。