New 21 Game LeetCode solution in Java

1
class Solution {
2
  public double new21Game(int n, int k, int maxPts) {
3
    double[] dp = new double[k + maxPts];
4
    dp[0] = 1;
5
    for (int i = 0; i < k; i++) {
6
      for (int j = 1; j <= maxPts; j++) {
7
        dp[i + j] += dp[i] * 1.0 / maxPts;
8
      }
9
    }
10

11
    double ans = 0;
12
    for (int i = k; i < k + maxPts && i <= n; i++) {
13
      ans += dp[i];
14
    }
15

16
    return ans;
17
  }
18
}