leetcode
魔法少女啊
人间温柔观察者
展开
-
数据库 leetcode 183
select b.name as Department,a.name as Employee,a.Salaryfrom Employee a join Department b on a.DepartmentId=b.id and (a.salary,a.DepartmentId) in (select max(salary),DepartmentId from Employee group by DepartmentId)经典的topnselect Department, Employee,原创 2021-06-10 16:14:50 · 215 阅读 · 1 评论 -
数据库leetcode 182
数据库#按照Email进行分组,然后统计大于1的email、进行输出SELECT Email FROM Person group by Email having count(email)>12.先将表进行自粘接,然后统计出来两个表中相同的email是否有不同的id,如果有,证明是的SELECT distinct a.emailFROM Person a join Person b on a.email = b.email and a.id !=b.idSELECT dist原创 2021-06-09 16:52:12 · 66 阅读 · 0 评论 -
2021-06-08--leetcode 连续出现的数字
leetcode 数据库180. 连续出现的数字select distinct l1.Num as ConsecutiveNums from Logs l1 join logs l2 on l1.id = l2.id-1 join logs l3 on l1.id = l3.id+1 where l1.Num=l3.Num and l1.Num=l2.Num步骤解析:表l1:| 表l1join表l2.id-1表l1joinl3.id+1最后的盛夏的数据为1...原创 2021-06-08 16:37:37 · 78 阅读 · 0 评论 -
2021-05-12
leetcode1题型:1.普通建表+哈希class Solution:def twoSum(self, nums: List[int], target: int) -> List[int]:result=[]mapping = {}#建表for i in range(0,len(nums)):mapping[nums[i]]=i#从哈希表中搜需哦for j in range(0,len(nums)):diff = target-nums[j]if (diff in mapp原创 2021-05-12 14:22:26 · 59 阅读 · 0 评论