Leetcode:180. 连续出现的数字-连续问题

 

 方法一:id和排序差的思想(极其推荐)

select distinct num as ConsecutiveNums from 
(select num,id-cast(dense_rank() over (partition by num order by id asc) as signed)  as rn from logs) t1
group by rn,num
having count(*)>=3

方法二:lead(一般推荐)

select distinct num as ConsecutiveNums
from(
select id,num,lead(num,1) over(order by id) as a,lead(num,2) over(order by id) as b
from `logs`
) t
where num=a and a=b

 方法三:自连接(不推荐)

select distinct 
    l1.Num AS ConsecutiveNums
from
    Logs l1,
    Logs l2,
    Logs l3
where 
    l1.Id = l2.Id - 1
    AND l2.Id = l3.Id - 1
    AND l1.Num = l2.Num
    AND l2.Num = l3.Num
;
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值