mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -9,8 +9,8 @@
|
||||
| salary | int |
|
||||
| departmentId | int |
|
||||
+--------------+---------+
|
||||
id is the primary key column for this table.
|
||||
departmentId is a foreign key of the ID from the <code>Department </code>table.
|
||||
id is the primary key (column with unique values) for this table.
|
||||
departmentId is a foreign key (reference columns) of the ID from the <code>Department </code>table.
|
||||
Each row of this table indicates the ID, name, and salary of an employee. It also contains the ID of their department.
|
||||
</pre>
|
||||
|
||||
@@ -25,20 +25,20 @@ Each row of this table indicates the ID, name, and salary of an employee. It als
|
||||
| id | int |
|
||||
| name | varchar |
|
||||
+-------------+---------+
|
||||
id is the primary key column for this table.
|
||||
id is the primary key (column with unique values) for this table. It is guaranteed that department name is not <code>NULL.</code>
|
||||
Each row of this table indicates the ID of a department and its name.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p>Write an SQL query to find employees who have the highest salary in each of the departments.</p>
|
||||
<p>Write a solution to find employees who have the highest salary in each of the departments.</p>
|
||||
|
||||
<p>Return the result table in <strong>any order</strong>.</p>
|
||||
|
||||
<p>The query result format is in the following example.</p>
|
||||
<p>The result format is in the following example.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong>
|
||||
|
Reference in New Issue
Block a user