coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

移除零宽空格

Browse Source
This commit is contained in:
小墨
2025-09-28 16:53:26 +08:00
parent 440092a4c3
commit 2862a227c4
43 changed files with 52 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (English)/生成赛程(English) [generate-schedule].html
View File

@@ -20,7 +20,7 @@
<p><strong>Explanation:</strong></p>
<p>​​​​​​​Since each team plays every other team exactly twice, a total of 6 matches need to be played: <code>[0,1],[0,2],[1,2],[1,0],[2,0],[2,1]</code>.</p>
<p>Since each team plays every other team exactly twice, a total of 6 matches need to be played: <code>[0,1],[0,2],[1,2],[1,0],[2,0],[2,1]</code>.</p>
<p>It&#39;s not possible to create a schedule without at least one team playing consecutive days.</p>
</div>
@@ -43,5 +43,5 @@
<p><strong>Constraints:</strong></p>
<ul>
<li><code>2 &lt;= n &lt;= 50</code>​​​​​​​</li>
<li><code>2 &lt;= n &lt;= 50</code></li>
</ul>