1155. Number of Dice Rolls With Target Sum
Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 62% Topics: Dynamic Programming
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(d * f * t)
# Space: O(t)
class Solution(object):
def numRollsToTarget(self, d, f, target):
"""
:type d: int
:type f: int
:type target: int
:rtype: int
"""
MOD = 10**9+7
dp = [[0 for _ in xrange(target+1)] for _ in xrange(2)]
dp[0][0] = 1
for i in xrange(1, d+1):
dp[i%2] = [0 for _ in xrange(target+1)]
for k in xrange(1, f+1):
for j in xrange(k, target+1):
dp[i%2][j] = (dp[i%2][j] + dp[(i-1)%2][j-k]) % MOD
return dp[d%2][target] % MOD
Solution from kamyu104/LeetCode-Solutions · MIT