mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
51 lines
1.2 KiB
HTML
51 lines
1.2 KiB
HTML
<p>Table: <code>Seat</code></p>
|
|
|
|
<pre>
|
|
+-------------+---------+
|
|
| Column Name | Type |
|
|
+-------------+---------+
|
|
| id | int |
|
|
| student | varchar |
|
|
+-------------+---------+
|
|
id is the primary key (unique value) column for this table.
|
|
Each row of this table indicates the name and the ID of a student.
|
|
id is a continuous increment.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
|
|
<p>Write a solution to swap the seat id of every two consecutive students. If the number of students is odd, the id of the last student is not swapped.</p>
|
|
|
|
<p>Return the result table ordered by <code>id</code> <strong>in ascending order</strong>.</p>
|
|
|
|
<p>The result format is in the following example.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong>
|
|
Seat table:
|
|
+----+---------+
|
|
| id | student |
|
|
+----+---------+
|
|
| 1 | Abbot |
|
|
| 2 | Doris |
|
|
| 3 | Emerson |
|
|
| 4 | Green |
|
|
| 5 | Jeames |
|
|
+----+---------+
|
|
<strong>Output:</strong>
|
|
+----+---------+
|
|
| id | student |
|
|
+----+---------+
|
|
| 1 | Doris |
|
|
| 2 | Abbot |
|
|
| 3 | Green |
|
|
| 4 | Emerson |
|
|
| 5 | Jeames |
|
|
+----+---------+
|
|
<strong>Explanation:</strong>
|
|
Note that if the number of students is odd, there is no need to change the last one's seat.
|
|
</pre>
|