New 21 Game LeetCode solution in Python

1
# Runtime: 110 ms (Top 69.47%) | Memory: 14.5 MB (Top 12.98%)
2
class Solution:
3
    def new21Game(self, n: int, k: int, maxPts: int) -> float:
4
        dp = collections.deque([float(i <= n) for i in range(k, k + maxPts)])
5
        s = sum(dp)
6
        for i in range(k):
7
            dp.appendleft(s / maxPts)
8
            s += dp[0] - dp.pop()
9

10
        return dp[0]