1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>你的音乐播放器里有&nbsp;<code>N</code>&nbsp;首不同的歌,在旅途中,你的旅伴想要听 <code>L</code>&nbsp;首歌(不一定不同,即,允许歌曲重复)。请你为她按如下规则创建一个播放列表:</p>\n\n<ul>\n\t<li>每首歌至少播放一次。</li>\n\t<li>一首歌只有在其他 <code>K</code> 首歌播放完之后才能再次播放。</li>\n</ul>\n\n<p>返回可以满足要求的播放列表的数量。<strong>由于答案可能非常大,请返回它模&nbsp;<code>10^9 + 7</code>&nbsp;的结果。</strong></p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre><strong>输入:</strong>N = 3, L = 3, K = 1\n<strong>输出:</strong>6\n<strong>解释:</strong>有 6 种可能的播放列表。[1, 2, 3][1, 3, 2][2, 1, 3][2, 3, 1][3, 1, 2][3, 2, 1].\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>N = 2, L = 3, K = 0\n<strong>输出:</strong>6\n<strong>解释:</strong>有 6 种可能的播放列表。[1, 1, 2][1, 2, 1][2, 1, 1][2, 2, 1][2, 1, 2][1, 2, 2]\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre><strong>输入:</strong>N = 2, L = 3, K = 1\n<strong>输出:</strong>2\n<strong>解释:</strong>有 2 种可能的播放列表。[1, 2, 1][2, 1, 2]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ol>\n\t<li><code>0 &lt;= K &lt; N &lt;= L &lt;= 100</code></li>\n</ol>\n",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 90,
"likes": 93,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 2191, \"totalSubmissionRaw\": 4415, \"acRate\": \"49.6%\"}",
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"4.5K\", \"totalAcceptedRaw\": 2261, \"totalSubmissionRaw\": 4541, \"acRate\": \"49.8%\"}",
"hints": [],
"solution": null,
"status": null,