New 21 Game

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:

1. 0 <= K <= N <= 10000
2. 1 <= W <= 10000
3. Answers will be accepted as correct if they are within 10^-5 of the correct answer.
4. The judging time limit has been reduced for this question.

思路：类似爬楼梯的问题，每次可以跨[1,W]个楼梯，但是到了>=K的台阶的时候停止，问K ~ N之间的概率；

如果dp[i]表示点数和为i的概率，那么最后结果应该是dp[k]+dp[k+1]+…+dp[n]

1. 当i <= K时，dp[i] = (dp[i - W] + dp[i - W + 1] + ... + dp[i - 1]) / W；(爬楼梯得到总楼梯数为i的概率）
2. 当K < i < K + W时，那么在这次的前一次的点数范围是[i - W, K - 1]。我们的dp数组表示的是得到点i的概率，所以dp[i]=(dp[K-1]+dp[K-2]+…+dp[i-W])/W.（可以从前一次的基础的上选[1,W]个数字中的一个）
3. 当i>=K+W时，这种情况下无论如何不都应该存在的，所以dp[i]=0.

.......................i..........K...............W

..........................................N.....

那么就可以写到如下的brute force的解法 O((K + W) * W)；但是发现(dp[i - W] + dp[i - W + 1] + ... + dp[i - 1]) ， 是可以用prefixsum来O(1)解决的。那么就把dp的定义改变成sum[i], 那么结果就可以用prefixsum来做；优化之后，O(K + W);

class Solution {
    public double new21Game(int N, int K, int W) {
        if(K == 0) {
            return 1;
        }
        double[] dp = new double[K + W];
        dp[0] = 1;
        for(int i = 1; i < K + W; i++) {
            for(int j = 1; j <= W; j++) {
                if(i - j >= 0 && i - j < K) {
                    dp[i] += dp[i - j] / W;
                }
            }
        }
        
        double res = 0;
        for(int i = K; i <= N; i++) {
            res += dp[i];
        }
        return res;
    }
}

class Solution {
    public double new21Game(int N, int K, int W) {
        if(K == 0) {
            return 1;
        }
        double[] dp = new double[K + W];
        dp[0] = 1;
        for(int i = 1; i < dp.length; i++) {
            dp[i] = dp[i - 1];
            if(i <= W) {
                dp[i] += dp[i - 1] / W;
            } else {
                // i > W;
                dp[i] += (dp[i - 1] - dp[i - W - 1]) / W;
            }
            if(i > K) {
                dp[i] -= (dp[i - 1] - dp[K - 1]) / W; 
            }
        }
        
        return dp[N] - dp[K - 1];
    }
}