文章目录
练习一: 各部门工资最高的员工
(难度:中等)
创建Employee 表,包含所有员工信息,每个员工有其对应的 Id, salary 和 department Id。
+----+-------+--------+--------------+
| Id | Name | Salary | DepartmentId |
+----+-------+--------+--------------+
| 1 | Joe | 70000 | 1 |
| 2 | Henry | 80000 | 2 |
| 3 | Sam | 60000 | 2 |
| 4 | Max | 90000 | 1 |
+----+-------+--------+--------------+
创建Department 表,包含公司所有部门的信息。
+----+----------+
| Id | Name |
+----+----------+
| 1 | IT |
| 2 | Sales |
+----+----------+
编写一个 SQL 查询,找出每个部门工资最高的员工。例如,根据上述给定的表格,Max 在 IT 部门有最高工资,Henry 在 Sales 部门有最高工资。
+------------+----------+--------+
| Department | Employee | Salary |
+------------+----------+--------+
| IT | Max | 90000 |
| Sales | Henry | 80000 |
+------------+----------+--------+
答:
CREATE DATABASE task
USE task
CREATE TABLE Employee(
Id CHAR(1),
Name VARCHAR(50) NOT NULL,
Salary INTEGER NOT NULL,
DepartmentId CHAR(1) ,
PRIMARY KEY (Id));
CREATE TABLE Department(
Id CHAR(1),
Name VARCHAR(50) NOT NULL,
PRIMARY KEY (Id));
INSERT INTO Employee VALUES('1', 'Joe', 70000, "1");
INSERT INTO Employee VALUES('2', 'Henry', 80000, "2");
INSERT INTO Employee VALUES('3', 'Sam', 60000, "2");
INSERT INTO Employee VALUES('4', 'Max', 90000, "1");
INSERT INTO Department VALUES('1', 'IT');
INSERT INTO Department VALUES('2', 'Sales');
COMMIT;
SELECT p2.Name AS Department, p1.Name AS Employee, (SELECT MAX(Salary) GROUP BY DepartmentId)
FROM Employee AS p1
JOIN Department AS p2
ON p1.DepartmentId = p2.Id
GROUP BY p2.Name
--最后这句超重要,要不然就只输出一行
练习二: 换座位
(难度:中等)
小美是一所中学的信息科技老师,她有一张 seat 座位表,平时用来储存学生名字和与他们相对应的座位 id。
其中纵列的id是连续递增的
小美想改变相邻俩学生的座位。
你能不能帮她写一个 SQL query 来输出小美想要的结果呢?
请创建如下所示seat表:
示例:
+---------+---------+
| id | student |
+---------+---------+
| 1 | Abbot |
| 2 | Doris |
| 3 | Emerson |
| 4 | Green |
| 5 | Jeames |
+---------+---------+
假如数据输入的是上表,则输出结果如下:
+---------+---------+
| id | student |
+---------+---------+
| 1 | Doris |
| 2 | Abbot |
| 3 | Green |
| 4 | Emerson |
| 5 | Jeames |
+---------+---------+
注意:
如果学生人数是奇数,则不需要改变最后一个同学的座位。
答:
USE task
CREATE TABLE seat(
id CHAR(1),
student VARCHAR(80) NOT NULL,
PRIMARY KEY (id));
INSERT INTO seat VALUES('1', 'Abbot');
INSERT INTO seat VALUES('2', 'Doris');
INSERT INTO seat VALUES('3', 'Emerson');
INSERT INTO seat VALUES('4', 'Green');
INSERT INTO seat VALUES('5', 'Jeames');
COMMIT;
SELECT
(CASE
WHEN MOD(id, 2) != 0 AND counts != id THEN id + 1
WHEN MOD(id, 2) != 0 AND counts = id THEN id
ELSE id - 1
END) AS id,
student
FROM
seat,
(SELECT
COUNT(*) AS counts
FROM
seat) AS seat_counts
ORDER BY id ASC;
练习三: 分数排名
(难度:中等)
编写一个 SQL 查询来实现分数排名。如果两个分数相同,则两个分数排名(Rank)相同。请注意,平分后的下一个名次应该是下一个连续的整数值。换句话说,名次之间不应该有“间隔”。
创建以下score表:
+----+-------+
| Id | Score |
+----+-------+
| 1 | 3.50 |
| 2 | 3.65 |
| 3 | 4.00 |
| 4 | 3.85 |
| 5 | 4.00 |
| 6 | 3.65 |
+----+-------+
例如,根据上述给定的 Scores 表,你的查询应该返回(按分数从高到低排列):
+-------+------+
| Score | Rank |
+-------+------+
| 4.00 | 1 |
| 4.00 | 1 |
| 3.85 | 2 |
| 3.65 | 3 |
| 3.65 | 3 |
| 3.50 | 4 |
+-------+------+
答:
CREATE TABLE score(
Id CHAR(1),
Score DOUBLE NOT NULL,
PRIMARY KEY (Id));
INSERT INTO score VALUES('1', 3.50);
INSERT INTO score VALUES('2', 3.65);
INSERT INTO score VALUES('3', 4.00);
INSERT INTO score VALUES('4', 3.85);
INSERT INTO score VALUES('5', 4.00);
INSERT INTO score VALUES('6', 3.65);
COMMIT;
SELECT Score,
DENSE_RANK() OVER (ORDER BY Score DESC) AS Rank1
FROM score;
练习四:连续出现的数字
(难度:中等)
编写一个 SQL 查询,查找所有至少连续出现三次的数字。
+----+-----+
| Id | Num |
+----+-----+
| 1 | 1 |
| 2 | 1 |
| 3 | 1 |
| 4 | 2 |
| 5 | 1 |
| 6 | 2 |
| 7 | 2 |
+----+-----+
例如,给定上面的 Logs 表, 1 是唯一连续出现至少三次的数字。
+-----------------+
| ConsecutiveNums |
+-----------------+
| 1 |
+-----------------+
答:
CREATE TABLE Logs(
Id CHAR(1),
Num INTEGER NOT NULL,
PRIMARY KEY (Id));
INSERT INTO Logs VALUES('1', 1);
INSERT INTO Logs VALUES('2', 1);
INSERT INTO Logs VALUES('3', 1);
INSERT INTO Logs VALUES('4', 2);
INSERT INTO Logs VALUES('5', 1);
INSERT INTO Logs VALUES('6', 2);
INSERT INTO Logs VALUES('7', 2);
COMMIT;
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;
练习五:树节点
(难度:中等)
对于tree表,id是树节点的标识,p_id是其父节点的id。
+----+------+
| id | p_id |
+----+------+
| 1 | null |
| 2 | 1 |
| 3 | 1 |
| 4 | 2 |
| 5 | 2 |
+----+------+
每个节点都是以下三种类型中的一种:
Root: 如果节点是根节点。
Leaf: 如果节点是叶子节点。
Inner: 如果节点既不是根节点也不是叶子节点。
写一条查询语句打印节点id及对应的节点类型。按照节点id排序。上面例子的对应结果为:
+----+------+
| id | Type |
+----+------+
| 1 | Root |
| 2 | Inner|
| 3 | Leaf |
| 4 | Leaf |
| 5 | Leaf |
+----+------+
说明
节点’1’是根节点,因为它的父节点为NULL,有’2’和’3’两个子节点。
节点’2’是内部节点,因为它的父节点是’1’,有子节点’4’和’5’。
节点’3’,‘4’,'5’是叶子节点,因为它们有父节点但没有子节点。
下面是树的图形:
1
/ \
2 3
/ \
4 5
注意
如果一个树只有一个节点,只需要输出根节点属性。
答:
CREATE TABLE tree(
id CHAR(1),
p_id INTEGER ,
PRIMARY KEY (id));
INSERT INTO tree VALUES('1', null);
INSERT INTO tree VALUES('2', 1);
INSERT INTO tree VALUES('3', 1);
INSERT INTO tree VALUES('4', 2);
INSERT INTO tree VALUES('5', 2);
COMMIT;
SELECT id,
CASE WHEN p_id IS NULL THEN 'Root'
WHEN id in (SELECT p_id FROM tree) THEN 'Inner'
ELSE 'Leaf' END
AS TYPE
FROM tree
ORDER BY id
练习六:至少有五名直接下属的经理
(难度:中等)
Employee表包含所有员工及其上级的信息。每位员工都有一个Id,并且还有一个对应主管的Id(ManagerId)。
+------+----------+-----------+----------+
|Id |Name |Department |ManagerId |
+------+----------+-----------+----------+
|101 |John |A |null |
|102 |Dan |A |101 |
|103 |James |A |101 |
|104 |Amy |A |101 |
|105 |Anne |A |101 |
|106 |Ron |B |101 |
+------+----------+-----------+----------+
针对Employee表,写一条SQL语句找出有5个下属的主管。对于上面的表,结果应输出:
+-------+
| Name |
+-------+
| John |
+-------+
注意:
没有人向自己汇报。
答:
CREATE TABLE Employee(
Id CHAR(3),
Name VARCHAR(30),
Department VARCHAR(10),
ManagerId Integer,
PRIMARY KEY (Id));
INSERT INTO Employee VALUES('101', John, A, null);
INSERT INTO Employee VALUES('102', Dan, A, 101);
INSERT INTO Employee VALUES('103', James, A, 101);
INSERT INTO Employee VALUES('104', Amy, A, 101);
INSERT INTO Employee VALUES('105', Anne, A, 101);
INSERT INTO Employee VALUES('106', Ron, B, 101);
COMMIT;
Select Name
FROM Employee
WHERE Id in
(
SELECT ManagerId
FROM Employee
GROUP BY ManagerId
HAVING count(*) >= 5
)
练习七: 分数排名
(难度:中等)
练习三的分数表,实现排名功能,但是排名需要是非连续的,如下:
+-------+------+
| Score | Rank |
+-------+------+
| 4.00 | 1 |
| 4.00 | 1 |
| 3.85 | 3 |
| 3.65 | 4 |
| 3.65 | 4 |
| 3.50 | 6 |
+-------+------
答:
SELECT Score,
RANK() OVER (ORDER BY Score DESC) AS Rank1
FROM score;
练习八:查询回答率最高的问题
(难度:中等)
求出survey_log表中回答率最高的问题,表格的字段有:uid, action, question_id, answer_id, q_num, timestamp。
uid是用户id;action的值为:“show”, “answer”, “skip”;当action是"answer"时,answer_id不为空,相反,当action是"show"和"skip"时为空(null);q_num是问题的数字序号。
写一条sql语句找出回答率最高的问题。
举例:
输入
uid action question_id answer_id q_num timestamp
5 show 285 null 1 123
5 answer 285 124124 1 124
5 show 369 null 2 125
5 skip 369 null 2 126
输出
survey_log
285
说明
问题285的回答率为1/1,然而问题369的回答率是0/1,所以输出是285。
**注意:**最高回答率的意思是:同一个问题出现的次数中回答的比例。
答:
SELECT
question_id AS survey_log
FROM
survey_log
GROUP BY question_id
ORDER BY COUNT(answer_id) / COUNT(IF(action = 'show', 1, 0)) DESC
LIMIT 1;
练习九:各部门前3高工资的员工
(难度:中等)
将项目7中的employee表清空,重新插入以下数据(其实是多插入5,6两行):
+----+-------+--------+--------------+
| Id | Name | Salary | DepartmentId |
+----+-------+--------+--------------+
| 1 | Joe | 70000 | 1 |
| 2 | Henry | 80000 | 2 |
| 3 | Sam | 60000 | 2 |
| 4 | Max | 90000 | 1 |
| 5 | Janet | 69000 | 1 |
| 6 | Randy | 85000 | 1 |
+----+-------+--------+--------------+
编写一个 SQL 查询,找出每个部门工资前三高的员工。例如,根据上述给定的表格,查询结果应返回:
+------------+----------+--------+
| Department | Employee | Salary |
+------------+----------+--------+
| IT | Max | 90000 |
| IT | Randy | 85000 |
| IT | Joe | 70000 |
| Sales | Henry | 80000 |
| Sales | Sam | 60000 |
+------------+----------+--------+
此外,请考虑实现各部门前N高工资的员工功能。
答:
SELECT department_name, emplyee_name, salary
FROM department
JOIN(
SELECT emplyee_name,
department_id,
salary,
DENSE_RANK() over (PARTITION BY department_id
ORDER BY salary DESC) as "rank"
FROM employee) salary_rank
ON department.department_id=salary_rank.department_id
WHERE salary_rank.rank<4
;
练习十:平面上最近距离
(难度: 困难)
point_2d表包含一个平面内一些点(超过两个)的坐标值(x,y)。
写一条查询语句求出这些点中的最短距离并保留2位小数。
x | y |
---|---|
-1 | -1 |
0 | 0 |
-1 | -2 |
最短距离是1,从点(-1,-1)到点(-1,-2)。所以输出结果为:
| shortest |
1.00
+--------+
|shortest|
+--------+
|1.00 |
+--------+
注意: 所有点的最大距离小于10000。
答:
SELECT MIN(ROUND(SQRT((POW(p1.x-p2.x, 2)+POW(p1.y-p2.y, 2))), 2)) AS shortest
FROM point_2d as p1,
point_2d as p2
WHERE p1.x > p2.x OR p1.y > p2.y;
练习十一:行程和用户
(难度:困难)
Trips 表中存所有出租车的行程信息。每段行程有唯一键 Id,Client_Id 和 Driver_Id 是 Users 表中 Users_Id 的外键。Status 是枚举类型,枚举成员为 (‘completed’, ‘cancelled_by_driver’, ‘cancelled_by_client’)。
Id Client_Id Driver_Id City_Id Status Request_at
1 1 10 1 completed 2013-10-1
2 2 11 1 cancelled_by_driver 2013-10-1
3 3 12 6 completed 2013-10-1
4 4 13 6 cancelled_by_client 2013-10-1
5 1 10 1 completed 2013-10-2
6 2 11 6 completed 2013-10-2
7 3 12 6 completed 2013-10-2
8 2 12 12 completed 2013-10-3
9 3 10 12 completed 2013-10-3
10 4 13 12 cancelled_by_driver 2013-10-3
Users 表存所有用户。每个用户有唯一键 Users_Id。Banned 表示这个用户是否被禁止,Role 则是一个表示(‘client’, ‘driver’, ‘partner’)的枚举类型。
+----------+--------+--------+
| Users_Id | Banned | Role |
+----------+--------+--------+
| 1 | No | client |
| 2 | Yes | client |
| 3 | No | client |
| 4 | No | client |
| 10 | No | driver |
| 11 | No | driver |
| 12 | No | driver |
| 13 | No | driver |
+----------+--------+--------+
写一段 SQL 语句查出2013年10月1日至2013年10月3日期间非禁止用户的取消率。基于上表,你的 SQL 语句应返回如下结果,取消率(Cancellation Rate)保留两位小数。
+------------+-------------------+
| Day | Cancellation Rate |
+------------+-------------------+
| 2013-10-01 | 0.33 |
| 2013-10-02 | 0.00 |
| 2013-10-03 | 0.50 |
+------------+-------------------+
答:
with cte as(
SELECT t.*
FROM Trips t
JOIN Users u1 ON t.client_id=u1.users_id
JOIN Users u2 ON t.driver_id=u2.users_id
WHERE u1.banned='No' AND u2.banned='No'
)
SELECT request_at as "Day",
round(sum(IF(Status='completed',0,1))/count(status),2) as "Cancellation Rate"
FROM cte
WHERE request_at BETWEEN '2013-10-01' AND '2013-10-03'
GROUP BY request_at
ORDER BY request_at