175. Combine Two Tables

使用外连接即可。

# Write your MySQL query statement below
select FirstName, LastName, City, State from Person left outer join Address on Person.PersonId = Address.PersonId; # Write your MySQL query statement below
select p.FirstName, p.LastName, a.City, a.State from Person as p left outer join Address as a on p.PersonId = a.PersonId;

176. Second Highest Salary

查询第二高工资值,可能无此值。使用聚集函数与子查询即可,注意MAX可能返回NULL。

# Write your MySQL query statement below
select max(Salary) as SecondHighestSalary from Employee where Salary < (select max(Salary) from Employee); # Write your MySQL query statement below
select max(Salary) as SecondHighestSalary from Employee where Salary not in(select max(Salary) from Employee);

177. Nth Highest Salary

查询第N高工资值,可能无此值。使用IFNULL,然后再对结果进行限制即可。

CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INT
BEGIN
DECLARE M INT;
SET M = N - 1;
RETURN (
# Write your MySQL query statement below.
SELECT IFNULL((SELECT DISTINCT Salary FROM Employee ORDER BY Salary DESC LIMIT M, 1), NULL)
);
END

178. Rank Scores

按得分排名并计算排名。使用子查询、聚集函数,然后再对结果进行排序即可。

# Write your MySQL query statement below
select Scores.Score, (select count(*) from (select distinct Score from Scores) as DistinctScores where DistinctScores.Score >= Scores.Score) as Rank from Scores order by Score desc; # Write your MySQL query statement below
select Scores.Score, count(DistinctScores.Score) as Rank from Scores, (select distinct Score from Scores) as DistinctScores where Scores.Score <= DistinctScores.Score group by Scores.Id, Scores.Score order by Scores.Score desc;

180. Consecutive Numbers

找出至少连续出现3次的Num。先排序,再查询即可。也有人使用变量来解答。

# Write your MySQL query statement below
select distinct(l1.Num) as ConsecutiveNums from Logs l1, Logs l2, Logs l3 where l1.Id + 1 = l2.Id and l1.Id + 2 = l3.Id and l1.Num = l2.Num and l1.Num = l3.Num;

181. Employees Earning More Than Their Managers

查询工资比上司高的员工。使用自连接即可。

# Write your MySQL query statement below
select e1.Name as Employee from Employee as e1, Employee as e2 where e1.ManagerId = e2.Id and e1.Salary > e2.Salary;

182. Duplicate Emails

查找表中有重复的emails。使用数据分组或自连接即可。

# Write your MySQL query statement below
select Email from Person group by Email having count(*) > 1; # Write your MySQL query statement below
select distinct(p1.Email) from Person as p1, Person as p2 where p1.Id != p2.Id and p1.Email = p2.Email;

183. Customers Who Never Order

查出没有订单的客户。使用数据过滤即可。

# Write your MySQL query statement below
select Name as Customers from Customers where Customers.Id not in (select distinct(CustomerId) from Orders);

184. Department Highest Salary

查询每个部内最高的工资,最高工资可能有多个员工。这题相对来说稍复杂,使用子查询与数据分组来解决。

# Write your MySQL query statement below
select Department.Name as Department, Employee.Name as Employee, max(Salary) as Salary from Employee, Department where Employee.DepartmentId = Department.Id;
# 错误解法,结果会出现[null, null, null]这种情况 # Write your MySQL query statement below
select Department.Name as Department, Employee.Name as Employee, Salary from Employee, Department where Employee.DepartmentId = Department.Id order by Salary limit 1;
# 错误解法,结果只会有一行 # Write your MySQL query statement below
select d.Name as Department, e.Name as Employee, e.Salary as Salary
from Department as d, (select Name, max(Salary) as Salary, DepartmentId from Employee group by DepartmentId) as e
where d.Id = e.DepartmentId;
# 错误解法,当同一部门有两个最高的Salary时候,结果只有一行,故必须使用下面解法,使用2个Employee表 # Write your MySQL query statement below
select d.Name as Department, e.Name as Employee, e.Salary as Salary
from Department as d, Employee as e, (select max(Salary) as Salary, DepartmentId from Employee group by DepartmentId) as h
where d.Id = h.DepartmentId and e.Salary = h.Salary and e.DepartmentId = h.DepartmentId;

LeetCode Database题解的更多相关文章

  1. LeetCode OJ 题解

    博客搬至blog.csgrandeur.com,cnblogs不再更新. 新的题解会更新在新博客:http://blog.csgrandeur.com/2014/01/15/LeetCode-OJ-S ...

  2. Leetcode 简略题解 - 共567题

    Leetcode 简略题解 - 共567题     写在开头:我作为一个老实人,一向非常反感骗赞.收智商税两种行为.前几天看到不止两三位用户说自己辛苦写了干货,结果收藏数是点赞数的三倍有余,感觉自己的 ...

  3. LeetCode 算法题解 js 版 (001 Two Sum)

    LeetCode 算法题解 js 版 (001 Two Sum) 两数之和 https://leetcode.com/problems/two-sum/submissions/ https://lee ...

  4. leetcode & lintcode 题解

    刷题备忘录,for bug-free 招行面试题--求无序数组最长连续序列的长度,这里连续指的是值连续--间隔为1,并不是数值的位置连续 问题: 给出一个未排序的整数数组,找出最长的连续元素序列的长度 ...

  5. LeetCode一句话题解

    深度优先搜索 人生经验 1. 需要输出所有解.并由于元素集有重复元素,要求返回的结果需要去重的情况,可考虑使用值对应数量的map,然后分别考虑依次取不同数量该值的可能. LeetCode39 题目:给 ...

  6. [leetcode] 位操作题解

    子集 题目[78]:给定一组不含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集). 示例: 输入: nums = [1,2,3] 输出: [ [3],   [1],   [2],   [ ...

  7. LeetCode 中等题解(3)

    34 在排序数组中查找元素的第一个和最后一个位置 Question 给定一个按照升序排列的整数数组 nums,和一个目标值 target.找出给定目标值在数组中的开始位置和结束位置. 你的算法时间复杂 ...

  8. LeetCode 中等题解(1)

    16 最接近的三数之和 Question 给定一个包括 n 个整数的数组 nums 和 一个目标值 target.找出 nums 中的三个整数,使得它们的和与 target 最接近.返回这三个数的和. ...

  9. leetcode database题目

    LeetCode有10道SQL的题目,最近学习SQL语言,顺便刷题强化一下, 说实话刷完SQL学习指南这本书,不是很难,上面的例子 跟语法规则我都能理解透, 实际中来做一些比较难的业务逻辑题,却一下子 ...

随机推荐

  1. Client与Server

    监听套接字,通讯套接字,初始化网卡,多线程.想查自己的IP,ipconfig 服务端 #include "stdafx.h" #include <WinSock2.h> ...

  2. 如何用70行Java代码实现深度神经网络算法

    http://www.tuicool.com/articles/MfYjQfV 如何用70行Java代码实现深度神经网络算法 时间 2016-02-18 10:46:17  ITeye 原文  htt ...

  3. JMS连接WMQ及收发消息

    因为对JMS的了解也只算入门级,有些概念也很模糊,不过,卤煮会尽可能去介绍的.另外,sample code都调试过可以跑. 1.神马是JMS? jms即Java消息服务(Java Message Se ...

  4. Spark 的combineByKey函数

    在Spark中有许多聚类操作是基于combineByKey的,例如group那个家族的操作等.所以combineByKey这个函数也是比较重要,所以下午花了点时间看来下这个函数.也参考了http:// ...

  5. 微信小程序一些简单的快捷键

    常用快捷键 格式调整 Ctrl+S:保存文件Ctrl+[, Ctrl+]:代码行缩进Ctrl+Shift+[, Ctrl+Shift+]:折叠打开代码块Ctrl+C Ctrl+V:复制粘贴,如果没有选 ...

  6. jquery中,使用append增加元素时,该元素的绑定监听事件失效

    举例:如果在一个<div id="resultArea"></div>中,通过append添加一个id="checkOutTip"的文本 ...

  7. ListView与RadioButton组合——自定义单选列表

      标签: radiobuttonlistviewandroidlayout 2013-09-10 11:13 19396人阅读 评论(8) 收藏 举报  分类: Android(19)  版权声明: ...

  8. html中的图片、css、js等路径加载问题

    网页文件的存取路径有3种:物理路径.绝对路径和相对路径. 物理路径就是你的文件放在主机上的具体位置,例如:D:\\image\\1.jpg 这种格式,该方法可以很快确定出你的文件,但是在网页显示路径基 ...

  9. N-gram语言模型简单介绍

    N-gram语言模型 考虑一个语音识别系统,假设用户说了这么一句话:"I have a gun",因为发音的相似,该语音识别系统发现如下几句话都是可能的候选:1.I have a ...

  10. MapReduce 简单的全文搜索2

    上一个全文搜索实现了模糊查找,这个主要实现了精确查找,就是比如你查找mapreduce is simple那么他就只查找有这个句子的文章,而不是查找有这三个单词的文章. 这个版本需要重写反向索引,因为 ...