leetcode mysql题由简入深(未完持续)

本文分享了LeetCode上多个SQL挑战题目的解决方案,包括BigCountries、SwapSalary、NotBoringMovies等,涵盖了查找、更新、分组、连接及复杂查询技巧。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

面试被虐的我 只能刷leetcode了


595、Big Countries(正常的查找)
select name, population, area from World where(population>25000000 or area>3000000);
627、Swap Salary(交换m和f)
update salary
set sex=
case sex
when ‘f’ then ‘m’
when ‘m’ then ‘f’
end;
看到一个case写的非常好的文章: https://www.cnblogs.com/aipan/p/7770611.html
620、Not Boring Movies(id为奇数,排列)
select * from cinema where (description!=‘boring’ and id%2=1) order by rating desc;
182、Duplicate Emails(输出重复行,select嵌套)
select Email from(select Email, count(Email) as count from Person group by Email) as haha where count>1;
也可以用group by having,详细参考: https://www.cnblogs.com/gqs92/archive/2017/04/26/6767973.html
175、Combine Two Tables(left join用法)
select a.Firstname, a.LastName, b.City, b.State from Person a left join Address b on a.PersonId=b.PersonId;


181、Employees Earning More Than Their Managers(inner join,select嵌套)
select Employee from(select a.Name as Employee,a.Salary,b.Name as mName, b.Salary as mSalary from Employee a inner join Employee b on a.ManagerId=b.Id)as haha where Salary>mSalary;
select a.Name as Employee from Employee as a inner join Employee as b on a.ManagerId=b.Id where a.Salary>b.Salary;

答案2:
SELECT
a.Name AS ‘Employee’
FROM
Employee AS a,
Employee AS b
WHERE
a.ManagerId = b.Id
AND a.Salary > b.Salary
;

183、Customers Who Never Order(两个表join,null判断)
select Customers from(select a.Name as Customers,b.Id as order_id from Customers a left join Orders b on a.Id=b.CustomerId)as haha where order_id is null;
select a.Name as Customers from Customers as a where a.Id not in (select CustomerId from Orders);
596、Classes More Than 5 Students(去重,分组,group by having)
select class from (
select class, count(class) as num from(
select * from courses group by class,student
) as heihei group by class
) as haha where num>=5;

select class from(select * from courses group by student,class)as haha group by class having count(class)>=5;
197、Rising Temperature

内容概要:本文档详细介绍了基于MATLAB实现的无人机三维路径规划项目,核心算法采用蒙特卡罗树搜索(MCTS)。项目旨在解决无人机在复杂三维环境中自主路径规划的问,通过MCTS的随机模拟与渐进式搜索机制,实现高效、智能化的路径规划。项目不仅考虑静态环境建模,还集成了障碍物检测与避障机制,确保无人机飞行的安全性和效率。文档涵盖了从环境准备、数据处理、算法设计与实现、模型训练与预测、性能评估到GUI界面设计的完整流程,并提供了详细的代码示例。此外,项目采用模块化设计,支持多无人机协同路径规划、动态环境实时路径重规划等未来改进方向。 适合人群:具备一定编程基础,特别是熟悉MATLAB和无人机技术的研发人员;从事无人机路径规划、智能导航系统开发的工程师;对MCTS算法感兴趣的算法研究人员。 使用场景及目标:①理解MCTS算法在三维路径规划中的应用;②掌握基于MATLAB的无人机路径规划项目开发全流程;③学习如何通过MCTS算法优化无人机在复杂环境中的飞行路径,提高飞行安全性和效率;④为后续多无人机协同规划、动态环境实时调整等高级应用打下基础。 其他说明:项目不仅提供了详细的理论解释和技术实现,还特别关注了实际应用中的挑战和解决方案。例如,通过多阶段优化与迭代增强机制提升路径质量,结合环境建模与障碍物感知保障路径安全,利用GPU加速推理提升计算效率等。此外,项目还强调了代码模块化与调试便利性,便于后续功能扩展和性能优化。项目未来改进方向包括引入深度强化学习辅助路径规划、扩展至多无人机协同路径规划、增强动态环境实时路径重规划能力等,展示了广阔的应用前景和发展潜力。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值