Description
Alice plays the following game, loosely based on the card game “21”.
Alice starts with 0 points, and draws numbers while she has less than K points. During each draw, she gains an integer number of points randomly from the range [1, W], where W is an integer. Each draw is independent and the outcomes have equal probabilities.
Alice stops drawing numbers when she gets K or more points. What is the probability that she has N or less points?
Example 1:
Input: N = 10, K = 1, W = 10
Output: 1.00000
Explanation: Alice gets a single card, then stops.
Example 2:
Input: N = 6, K = 1, W = 10
Output: 0.60000
Explanation: Alice gets a single card, then stops.
In 6 out of W = 10 possibilities, she is at or below N = 6 points.
Example 3:
Input: N = 21, K = 17, W = 10
Output: 0.73278
Note:
0 <= K <= N <= 10000
1 <= W <= 10000
Answers will be accepted as correct if they are within 10^-5 of the correct answer.
The judging time limit has been reduced for this question.
Solution
一个类似于21点的游戏。一开始0分,在小于K分的时候抽卡,每次抽到的卡的范围是1-W,每次抽卡独立概率相等,当抽到大于等于1分之后停止抽卡,问得到N分或更少分数的概率。
Using a dp array to contain the probability to get this much points. Count them iteratively till N which bigger than K.
Code
class Solution {
public double new21Game(int N, int K, int W) {
if (K == 0 || N >= K - 1 + W){
return 1.0;
}
//dp[i]: probability of get points i. dp[i] = sum(last W dp values) / W
double[] dp = new double[N + 1];
double wSum = 1, res = 0;
dp[0] = 1;
for (int i = 1; i <= N; i++){
dp[i] = wSum / W;
if (i < K){
wSum += dp[i];
}
else{
res += dp[i];
}
if (i - W >= 0){
wSum -= dp[i - W];
}
}
return res;
}
}
Time Complexity: O(N)
Space Complexity: O(N)