• LeetCode——Department Highest Salary(花式使用IN以及GROUP BY)


    The Employee table holds all employees. Every employee has an Id, a salary, and there is also a column for the department Id.
    
    +----+-------+--------+--------------+
    | Id | Name  | Salary | DepartmentId |
    +----+-------+--------+--------------+
    | 1  | Joe   | 70000  | 1            |
    | 2  | Jim   | 90000  | 1            |
    | 3  | Henry | 80000  | 2            |
    | 4  | Sam   | 60000  | 2            |
    | 5  | Max   | 90000  | 1            |
    +----+-------+--------+--------------+
    The Department table holds all departments of the company.
    
    +----+----------+
    | Id | Name     |
    +----+----------+
    | 1  | IT       |
    | 2  | Sales    |
    +----+----------+
    Write a SQL query to find employees who have the highest salary in each of the departments. For the above tables, your SQL query should return the following rows (order of rows does not matter).
    
    +------------+----------+--------+
    | Department | Employee | Salary |
    +------------+----------+--------+
    | IT         | Max      | 90000  |
    | IT         | Jim      | 90000  |
    | Sales      | Henry    | 80000  |
    +------------+----------+--------+
    

    以前使用IN,都是局限于单个数值使用,从未尝试过多个数据使用IN.
    此题涉及两个表,肯定需要使用join操作.
    此外,需要选取每个Department 的最大数值,那么肯定涉及max以及group by操作.
    综合以上因素,答案如下所示:

    # Write your MySQL query statement below
    SELECT Employee.Name AS Employee, Employee.Salary, Department.Name AS Department 
    FROM Employee, Department 
    WHERE 
        Employee.DepartmentId = Department.Id
        AND (Employee.DepartmentId, Employee.Salary)
        IN 
            (SELECT Employee.DepartmentId, max(Employee.Salary)
             FROM Employee
             GROUP BY Employee.DepartmentId);
    
  • 相关阅读:
    「2017 Multi-University Training Contest 7」2017多校训练7
    「2017 Multi-University Training Contest 2」2017多校训练2
    「CF838B」 Diverging Directions
    对拍程序
    ACM中的fread读入
    「UVA10766」Organising the Organisation(生成树计数)
    荣耻
    CCF 201812-3 CIDR合并
    CCF 201909-3 字符画
    CTSC 2017 游戏[概率dp 线段树]
  • 原文地址:https://www.cnblogs.com/jason1990/p/11646434.html
Copyright © 2020-2023  润新知