mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
51 lines
1.1 KiB
HTML
51 lines
1.1 KiB
HTML
<p>表: <code>Seat</code></p>
|
||
|
||
<pre>
|
||
+-------------+---------+
|
||
| Column Name | Type |
|
||
+-------------+---------+
|
||
| id | int |
|
||
| name | varchar |
|
||
+-------------+---------+
|
||
Id是该表的主键列。
|
||
该表的每一行都表示学生的姓名和ID。
|
||
Id是一个连续的增量。
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p>编写SQL查询来交换每两个连续的学生的座位号。如果学生的数量是奇数，则最后一个学生的id不交换。</p>
|
||
|
||
<p>按 <code>id</code> <strong>升序</strong> 返回结果表。</p>
|
||
|
||
<p>查询结果格式如下所示。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入:</strong>
|
||
Seat 表:
|
||
+----+---------+
|
||
| id | student |
|
||
+----+---------+
|
||
| 1 | Abbot |
|
||
| 2 | Doris |
|
||
| 3 | Emerson |
|
||
| 4 | Green |
|
||
| 5 | Jeames |
|
||
+----+---------+
|
||
<strong>输出:</strong>
|
||
+----+---------+
|
||
| id | student |
|
||
+----+---------+
|
||
| 1 | Doris |
|
||
| 2 | Abbot |
|
||
| 3 | Green |
|
||
| 4 | Emerson |
|
||
| 5 | Jeames |
|
||
+----+---------+
|
||
<strong>解释:
|
||
</strong>请注意，如果学生人数为奇数，则不需要更换最后一名学生的座位。</pre>
|