leetcode

0 class Solution {

1 public:

2 double new21Game(int n, int k, int maxPts) {

3 if (k == 0 || n >= k + maxPts) return 1.0;

4 vector<double> dp(n + 1);

5 double sum = 1.0, ans = 0.0;

6

7 dp[0] = 1.0;

8 for (int i = 1; i < n + 1; i++) {

9 dp[i] = sum / maxPts;

10 (i < k ? sum : ans) += dp[i];

11 if (i - maxPts >= 0) sum -= dp[i - maxPts];

12 }

13

14 return ans;

15 }

16 };