Description
Your music player contains n
different songs. You want to listen to goal
songs (not necessarily different) during your trip. To avoid boredom, you will create a playlist so that:
- Every song is played at least once.
- A song can only be played again only if
k
other songs have been played.
Given n
, goal
, and k
, return the number of possible playlists that you can create. Since the answer can be very large, return it modulo 109 + 7
.
Example 1:
Input: n = 3, goal = 3, k = 1 Output: 6 Explanation: There are 6 possible playlists: [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], and [3, 2, 1].
Example 2:
Input: n = 2, goal = 3, k = 0 Output: 6 Explanation: There are 6 possible playlists: [1, 1, 2], [1, 2, 1], [2, 1, 1], [2, 2, 1], [2, 1, 2], and [1, 2, 2].
Example 3:
Input: n = 2, goal = 3, k = 1 Output: 2 Explanation: There are 2 possible playlists: [1, 2, 1] and [2, 1, 2].
Constraints:
0 <= k < n <= goal <= 100
Solution
Python3
class Solution:
def numMusicPlaylists(self, n: int, goal: int, k: int) -> int:
M = 10 ** 9 + 7
dp = [[0 for i in range(goal + 1)] for j in range(n + 1)]
for i in range(k + 1, n + 1):
for j in range(i, goal + 1):
if i == j or i == k + 1:
dp[i][j] = math.factorial(i)
else:
dp[i][j] = dp[i - 1][j - 1] * i + dp[i][j - 1] * (i - k)
return dp[n][goal] % M