组队学习sql之基础+综合练习

SQL基础学习

Task00~Task05都是基础理论，内容思维导图如下

MySQL Leetcode练习

Task06综合练习都是leetcode上中等等级的练习题，需要多加练习呀。

练习一: 184部门工资最高的员工

题目

创建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  |
+------------+----------+--------+

解答

• 思路1：利用窗口函数增加各部门最高工资列，然后返回工资与所在部分最高工资一致的行

SELECT Department,Employee,Salary
FROM 
(SELECT q.Name AS Department,p.Name AS Employee,p.Salary,
MAX(p.Salary) OVER (PARTITION BY p.DepartmentId) AS max_sal
FROM Employee p
INNER JOIN Department q
ON p.DepartmentId = q.Id) AS X
WHERE Salary = max_sal
ORDER BY Department;

• 思路2：利用多表连接得到所有信息【最后一表是部门工资最大值列】

SELECT q.Name AS Department,p.Name AS Employee,p.Salary
FROM Employee p
INNER JOIN Department q
ON p.DepartmentId = q.Id
INNER JOIN (SELECT DepartmentId,MAX(Salary) as max_sal FROM Employee GROUP BY DepartmentId) r
ON p.DepartmentId = r.DepartmentId AND p.Salary = r.max_sal;

• 思路3：利用IN子查询

SELECT q.Name AS Department,p.Name AS Employee,p.Salary
FROM Employee p
INNER JOIN Department q
ON p.DepartmentId = q.Id
WHERE (p.DepartmentId,p.Salary) IN (SELECT DepartmentId,MAX(Salary) as max_sal FROM Employee GROUP BY DepartmentId);

练习二: 626 换座位

题目

小美是一所中学的信息科技老师，她有一张 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  |
+---------+---------+

注意：
如果学生人数是奇数，则不需要改变最后一个同学的座位。

解答

思路：奇偶位置的同学id进行+1或-1计算

SELECT IF(mod(id,2)=1,IF(t.id=(SELECT COUNT(1) FROM seat t5),t.id,t.id+1),t.id-1) id,t.student FROM seat t
ORDER BY id;

练习三: 178. 分数排名

题目

编写一个 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    |
+-------+------+

解答

• 思路1 不等值查询+连接

SELECT t1.Score,t2.Rank
FROM Scores t1 JOIN
(SELECT COUNT(DISTINCT s2.Score) AS 'RANK',s1.Score FROM Scores s1,Scores s2
WHERE s1.Score<=s2.Score GROUP BY s1.Score) t2
ON t1.Score = t2.Score
ORDER BY t1.Score Desc

• 思路2 mysql自带的窗口函数

SELECT Score,
DENSE_RANK() OVER (ORDER BY Score DESC) AS 'Rank'
FROM Scores;

练习四: 180. 连续出现的数字

题目

编写一个 SQL 查询，查找所有至少连续出现三次的数字。

+----+-----+
| Id | Num |
+----+-----+
| 1  |  1  |
| 2  |  1  |
| 3  |  1  |
| 4  |  2  |
| 5  |  1  |
| 6  |  2  |
| 7  |  2  |
+----+-----+

例如，给定上面的 Logs 表， 1 是唯一连续出现至少三次的数字。

+-----------------+
| ConsecutiveNums |
+-----------------+
| 1               |
+-----------------+

解答

• 思路1 三张表自联接，只是id上有滑动情况

SELECT DISTINCT t1.Num AS ConsecutiveNums 
FROM Logs t1 LEFT JOIN Logs t2
ON t1.Id + 1 = t2.Id
LEFT JOIN Logs t3
ON t1.Id + 2 = t3.Id
WHERE t1.Num = t2.Num and t1.Num = t3.Num;

• 思路2 另一种连接方法

SELECT DISTINCT t1.Num AS ConsecutiveNums 
FROM Logs t1,Logs t2,Logs t3
WHERE t1.Id + 1 = t2.Id AND t1.Id + 2 = t3.Id AND t1.Num = t2.Num and t1.Num = t3.Num;

练习五: 608树节点

题目

对于tree表，id是树节点的标识，p_id是其父节点的id。

+----+------+
| id | p_id |
+----+------+
| 1  | null |
| 2  | 1    |
| 3  | 1    |
| 4  | 2    |
| 5  | 2    |
+----+------+

每个节点都是以下三种类型中的一种：

• Leaf: 如果节点是根节点。
• Root: 如果节点是叶子节点。
• 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

注意

如果一个树只有一个节点，只需要输出根节点属性。

解答

思路：计算父节点的个数、子节点的个数，如果父节点为0→根节点，如果子节点为0→叶节点，否则为Inner

SELECT p_id AS f,COUNT(id) AS branch
FROM tree
GROUP BY p_id;
  DELETE FROM tree WHERE id in (2,3,4,5);

SELECT T.id,(CASE WHEN T.p_id IS NULL THEN 'Root' WHEN P.branch >0 THEN 'Leaf' ELSE 'Inner' END) AS 'Type'
FROM tree T LEFT JOIN (SELECT p_id AS f,COUNT(id) AS branch FROM tree GROUP BY p_id) P
ON T.Id = P.f;

未完待续