Ai
1 Star 0 Fork 0

逸扬/leetcode-hub-mysql

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
lc-1949.test 1.70 KB
一键复制 编辑 原始数据 按行查看 历史
逸扬 提交于 2022-04-27 00:22 +08:00 . 1532-1596-1613-1709-1767-1831-1949-1951-1972 (9)
# $1949. 坚定的友谊
# https://leetcode-cn.com/problems/strong-friendship/
# SQL架构
Create table If Not Exists Friendship (user1_id int, user2_id int);
Truncate table Friendship;
insert into Friendship (user1_id, user2_id) values ('1', '2');
insert into Friendship (user1_id, user2_id) values ('1', '3');
insert into Friendship (user1_id, user2_id) values ('2', '3');
insert into Friendship (user1_id, user2_id) values ('1', '4');
insert into Friendship (user1_id, user2_id) values ('2', '4');
insert into Friendship (user1_id, user2_id) values ('1', '5');
insert into Friendship (user1_id, user2_id) values ('2', '5');
insert into Friendship (user1_id, user2_id) values ('1', '7');
insert into Friendship (user1_id, user2_id) values ('3', '7');
insert into Friendship (user1_id, user2_id) values ('1', '6');
insert into Friendship (user1_id, user2_id) values ('3', '6');
insert into Friendship (user1_id, user2_id) values ('2', '6');
# Write your MySQL query statement below
with tmp as (
select
user1_id,
user2_id
from
Friendship
union
select
user2_id,
user1_id
from
Friendship
)
select
id1 as user1_id,
id2 as user2_id,
count(*) as common_friend
from
(
select
t1.user1_id as id1,
t2.user1_id as id2
from
tmp t1
join tmp t2 on t1.user2_id = t2.user2_id
where
t1.user1_id < t2.user1_id
order by
t1.user1_id,
t2.user1_id
) tmp1
where
(id1, id2) in (
select
*
from
tmp
)
group by
id1,
id2
having
count(*) >= 3
order by
id1,
id2;
# clean-up
drop table Friendship;
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/gdut_yy/leetcode-hub-mysql.git
git@gitee.com:gdut_yy/leetcode-hub-mysql.git
gdut_yy
leetcode-hub-mysql
leetcode-hub-mysql
master

搜索帮助