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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/minimum-number-of-moves-to-seat-everyone.html
View File

@@ -11,7 +11,7 @@
<p>Note that there may be <strong>multiple</strong> seats or students in the <strong>same </strong>position at the beginning.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> seats = [3,1,5], students = [2,7,4]
@@ -23,7 +23,7 @@
In total, 1 + 2 + 1 = 4 moves were used.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> seats = [4,1,5,9], students = [1,3,2,6]
@@ -36,7 +36,7 @@ In total, 1 + 2 + 1 = 4 moves were used.
In total, 0 + 1 + 3 + 3 = 7 moves were used.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> seats = [2,2,6,6], students = [1,3,2,6]