mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
49 lines
1.3 KiB
HTML
49 lines
1.3 KiB
HTML
|
<p>Table: <code>Employee</code></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
+-------------+---------+
|
||
|
|
| Column Name | Type |
|
||
|
|
+-------------+---------+
|
||
|
|
| id | int |
|
||
|
|
| name | varchar |
|
||
|
|
| department | varchar |
|
||
|
|
| managerId | int |
|
||
|
|
+-------------+---------+
|
||
|
|
id is the primary key (column with unique values) for this table.
|
||
|
|
Each row of this table indicates the name of an employee, their department, and the id of their manager.
|
||
|
|
If managerId is null, then the employee does not have a manager.
|
||
|
|
No employee will be the manager of themself.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p>Write a solution to find managers with at least <strong>five direct reports</strong>.</p>
|
||
|
|
|
||
|
|
<p>Return the result table in <strong>any order</strong>.</p>
|
||
|
|
|
||
|
|
<p>The result format is in the following example.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong>
|
||
|
|
Employee table:
|
||
|
|
+-----+-------+------------+-----------+
|
||
|
|
| 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 |
|
||
|
|
+-----+-------+------------+-----------+
|
||
|
|
<strong>Output:</strong>
|
||
|
|
+------+
|
||
|
|
| name |
|
||
|
|
+------+
|
||
|
|
| John |
|
||
|
|
+------+
|
||
|
|
</pre>
|