LeetCode:626. Exchange Seats

链接:
https://leetcode.com/problems/exchange-seats/description/

题目:
Mary is a teacher in a middle school and she has a table seat storing students’ names and their corresponding seat ids.

The column id is continuous increment.
Mary wants to change seats for the adjacent students.
Can you write a SQL query to output the result for Mary?
+———+———+
| id | student |
+———+———+
| 1 | Abbot |
| 2 | Doris |
| 3 | Emerson |
| 4 | Green |
| 5 | Jeames |
+———+———+
For the sample input, the output is:
+———+———+
| id | student |
+———+———+
| 1 | Doris |
| 2 | Abbot |
| 3 | Green |
| 4 | Emerson |
| 5 | Jeames |
+———+———+
Note:
If the number of students is odd, there is no need to change the last one’s seat.

思路:
case的运用,注意最大值如果是奇数的话不用改变位置。

Answer:

select case when id = (select max(id) from seat) and mod(id, 2) = 1 then id
            when id < (select max(id) from seat) and mod(id, 2) = 1 then id + 1
            when mod(id, 2) = 0 then id - 1
            end as id,
            student
from seat
order by
id
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值